Clause Elimination for SAT and QSAT
J. Artif. Intell. Res., pp. 127-168, 2015.
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...
Full Text (Upload PDF)
PPT (Upload PPT)
Best Paper of IJCAI, 2015