Dramatic improvements in SAT solver technology over the last decade and the growing
need for more efficient and scalable verification solutions have fueled research in …

Before a combinatorial problem can be solved by current SAT methods, it must usually be
encoded in conjunctive normal form, which facilitates algorithm implementation and allows a …

This system description paper introduces the OWL 2 reasoner HermiT. The reasoner is fully
compliant with the OWL 2 Direct Semantics as standardised by the World Wide Web …

We consider a fully SAT-based method of unbounded symbolic model checking based on
computing Craig interpolants. In benchmark studies using a set of large industrial circuit …

The phrase model checking refers to algorithms for exploring the state space of a transition
system to determine if it obeys a specification of its intended behavior. These algorithms can …

The last decade witnessed an ever-increasing stream of successes in Machine Learning
(ML). These successes offer clear evidence that ML is bound to become pervasive in a wide …

A decision procedure is an algorithm that, given a decision problem, terminates with a
correct yes/no answer. In this book, we focus on decision procedures for decidable first …

Handbook of Knowledge Representation describes the essential foundations of Knowledge
Representation, which lies at the core of Artificial Intelligence (AI). The book provides an up …

Written by prominent experts in the field, this monograph provides the first comprehensive,
unified presentation of the structural, algorithmic and applied aspects of the theory of …

Preprocessing SAT instances can reduce their size considerably. We combine variable
elimination with subsumption and self-subsuming resolution, and show that these …