Clause Elimination for SAT and QSAT

J. Artif. Intell. Res., pp. 127-168, 2015.

Cited by: 60|Bibtex|Views108|Links
EI

Abstract:

The famous archetypical NP-complete problem of Boolean satisfiability (SAT) and its PSPACE-complete generalization of quantified Boolean satisfiability (QSAT) have become central declarative progra...

Code:

Data:

Your rating :
0

 

Best Paper
Best Paper of IJCAI, 2015
Tags
Comments