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 …

The past five years have seen dramatic advances in planning algorithms, with an emphasis
on propositional methods such as GRAPHPLAN and compilers that convert planning …

This article summarizes the author's Robert S. Englemore Memorial Lecture presented at the
Thirty-Fourth AAAI Conference on Artificial Intelligence on February 10, 2020. It explores …

One of the most prominent application areas for quantum computers is solving hard
constraint satisfaction and optimization problems. However, detailed analyses of the …

Abstract Satisfiability Modulo Theories (SMT) refers to the problem of determining whether a
first-order formula is satisfiable with respect to some logical theory. Solvers based on SMT …

Intelligent agents are employed as the central characters in this introductory text. Beginning
with elementary reactive agents, Nilsson gradually increases their cognitive horsepower to …

No pleasure lasts long unless there is variety in it. Publilius Syrus, Moral Sayings We've
been very fortunate to receive fantastic feedback from our readers during the last four years …

Constraint satisfaction is a simple but powerful tool. Constraints identify the impossible and
reduce the realm of possibilities to effectively focus on the possible, allowing for a natural …

We report results from large-scale experiments in satisfiability testing. As has been observed
by others, testing the satisfiability of random formulas often appears surprisingly easy. Here …

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 …