Answer Set Programming (ASP) is a declarative problem solving approach, initially tailored
to modeling problems in the area of Knowledge Representation and Reasoning (KRR) …

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 …

We introduce an approach to computing answer sets of logic programs, based on concepts
successfully applied in Satisfiability (SAT) checking. The idea is to view inferences in …

Boolean satisfiability (SAT) solvers are currently very effective in practice. However, there
are still many challenging problems for SAT solvers. Nowadays, extra computational power …

The Silent (R)evolution of SAT Page 1 THE PROPOSITIONAL SATISFIABILITY problem (SAT)
was the first to be shown NP-complete by Cook and Levin. SAT remained the embodiment of …

Boolean satisfiability (SAT)-the problem of determining whether there exists an assignment
satisfying a given Boolean formula-is a fundamental intractable problem in computer …

This chapter gives an overview of proof complexity and connections to SAT solving, focusing
on proof systems such as resolution, Nullstellensatz, polynomial calculus, and cutting planes …

Preprocessing has become a key component of the Boolean satisfiability (SAT) solving
workflow. In practice, preprocessing is situated between the encoding phase and the solving …

The way CDCL SAT solvers find a satisfying assignment is very different from the way they
prove unsatisfiability. We propose an explanation to the difference by identifying direct …

As we celebrate the 50th knowledge acquisition conference this year it is appropriate to
review progress in knowledge acquisition techniques not only over the quarter century since …