The decision problem for Boolean satisfiability, generally referred to as SAT, is the
archetypal NP-complete problem, and encodings of many problems of practical interest exist …

MathSAT is a long-term project, which has been jointly carried on by FBK-IRST and
University of Trento, with the aim of develo** and maintaining a state-of-the-art SMT tool …

Propositional Satisfiability (SAT) and Constraint Programming (CP) have developed as two
relatively independent threads of research cross-fertilizing occasionally. These two …

Abstract The boolean Pythagorean Triples problem has been a longstanding open problem
in Ramsey Theory: Can the set N={1, 2,\dots\} of natural numbers be divided into two parts …

Perhaps surprisingly, it is possible to predict how long an algorithm will take to run on a
previously unseen input, using machine learning techniques to build a model of the …

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 …

A new form of SAT-based symbolic model checking is described. Instead of unrolling the
transition relation, it incrementally generates clauses that are inductive relative to (and …

Beside impressive progresses made by SAT solvers over the last ten years, only few works
tried to understand why Conflict Directed Clause Learning algorithms (CDCL) are so strong …

Potassco: The Potsdam Answer Set Solving Collection Page 1 AI Communications 24 (2011)
107–124 107 DOI 10.3233/AIC-2011-0491 IOS Press Potassco: The Potsdam Answer Set …

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 …