One of the most important paradigm shifts in the use of SAT solvers for solving industrial
problems has been the introduction of clause learning. Clause learning entails adding a …

The Boolean satisfiability problem (SAT) is a fundamental NP-complete decision problem in
automated reasoning and mathematical logic. As evidenced by the results of SAT …

ASP solvers address several reasoning tasks that go beyond the mere computation of
answer sets. Among them are cautious reasoning, for modeling query entailment, and …

All solutions SAT (AllSAT for short) is a variant of the propositional satisfiability problem.
AllSAT has been relatively unexplored compared to other variants despite its significance …

The backbone of a satisfiable formula is the set of literals that are true in all its satisfying
assignments. Backbone computation can improve a wide range of SAT-based applications …

The problem of propositional satisfiability (SAT) has found a number of applications in both
theoretical and practical computer science. In many applications, however, knowing a …

Boolean Satisfiability (SAT) is arguably the archetypical NP-complete decision problem.
Progress in SAT solving algorithms has motivated an ever increasing number of practical …

The localisation of faults in integrated circuits is a challenging problem and a dominating
factor in the overall verification effort. Electrical bugs, in particular, surface only in the …

The All-SAT problem deals with determining all the satisfying assignments that exist for a
given propositional logic formula. This problem occurs in verification applications including …

Modern competitive solvers employ various preprocessing techniques to efficiently tackle
complex problems. This work introduces two preprocessing techniques to improve solving …