This book is rooted in the thesis that complexity theory is extremely rich in conceptual
content, and that this contents should be explicitly communicated in expositions and courses …

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 …

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

In the first part of the paper we introduce a new theorem-proving procedure, that is a new
efficient method of communicating a proof. Any such method implies, directly or indirectly, a …

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

We prove that, for infinitely many disjunctive normal form propositional calculus tautologies
ξ, the length of the shortest resolution proof of ξ cannot be bounded by any polynomial of the …

Since their inception, the Perspectives in Logic and Lecture Notes in Logic series have
published seminal works by leading logicians. Many of the original books in the series have …

There are many kinds of books on formal logic. Some have philosophers as their intended
audience, some mathematicians, some computer scien tists. Although there is a common …

Over the last ten years, argumentation has come to be increasingly central as a core study
within Artificial Intelligence (AI). The articles forming this volume reflect a variety of important …

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 …