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 …

Description Logics are a family of knowledge representation languages that have been
studied extensively in Artificial Intelligence over the last two decades. They are embodied in …

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 …

Planning in nondeterministic domains yields both conceptual and practical difficulties. From
the conceptual point of view, different notions of planning problems can be devised: for …

The research on conditional planning rejects the assumptions that there is no uncertainty or
incompleteness of knowledge with respect to the state and changes of the system the plans …

Within the verification community, there has been a recent increase in interest in Quantified
Boolean Formula evaluation (QBF) as many interesting sequential circuit verification …

We compare SAT-checkers and decision diagrams on the evalua-tion of Boolean formulas
produced in the formal verification of both correct and buggy versions of superscalar and …

We tackle the problem of planning in nondeterministic domains, by presenting a new
approach to conformant planning. Conformant planning is the problem of finding a …

Planning under partial observability is one of the most significant and challenging planning
problems. It has been shown to be hard, both theoretically and experimentally. In this paper …

Algorithms based on the enumeration of implicit hitting sets find a growing number of
applications, which include maximum satisfiability and model based diagnosis, among …