Clause Elimination for SAT and QSAT

The famous archetypical NP-complete problem of Boolean satisfiability (SAT) and its PSPACE-complete generalization of quantified Boolean satisfiability (QSAT) have become central declarative programming paradigms through which real-world instances of various computationally hard problems can be effi...

Full description

Bibliographic Details

Published in:	The Journal of artificial intelligence research Vol. 53; pp. 127 - 168
Main Authors:	Heule, Marijn, Järvisalo, Matti, Lonsing, Florian, Seidl, Martina, Biere, Armin
Format:	Journal Article
Language:	English
Published:	San Francisco AI Access Foundation 01.01.2015
Subjects:	Artificial intelligence Boolean Boolean algebra Canonical forms Declarative programming Empirical analysis Polynomials Redundancy Simplification Solvers
ISSN:	1076-9757, 1076-9757, 1943-5037
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!