Publisher Summary The past few years have seen enormous progress in the performance of
Boolean satisfiability (SAT) solvers. Despite the worst-case exponential run time of all known …

Within the last decade, abstract argumentation has emerged as a central field in Artificial
Intelligence. Besides providing a core formalism for many advanced argumentation systems …

Constraint programming is a powerful paradigm for solving combinatorial search problems
that draws on a wide range of techniques from artificial intelligence, computer science …

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 …

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 …

A set of constraints that cannot be simultaneously satisfied is over-constrained. Minimal
relaxations and minimal explanations for over-constrained problems find many practical …

Graph partitioning is one of the most studied NP-complete problems. Given a graph G=(V,
E), the task is to partition the vertex set V into k disjoint subsets of about the same size, such …

Boolean satisfiability (SAT) is arguably the quintessential NP-complete problem, believed to
be intractable in general. Yet, over the last two decades, engineers have designed and …

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 …