Generating Minimal Unsatisfiable SAT Instances from Strong Digraphs

2020 22nd International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC) ◽

10.1109/synasc51798.2020.00024 ◽

2020 ◽

Author(s):

Gabor Kusper ◽

Tamas Balla ◽

Csaba Biro ◽

Tibor Tajti ◽

Zijian Gyozo Yang ◽

...

Download Full-text