We are seeing an increased push in the use of formal verification techniques in safety-
critical software and hardware in practice. Formal verification has been successfully used to …

“Satisfiability (SAT) related topics have attracted researchers from various disciplines: logic,
applied areas such as planning, scheduling, operations research and combinatorial …

We propose a perspective on knowledge compilation which calls for analyzing different
compilation approaches according to two key dimensions: the succinctness of the target …

This paper describes a new symbolic model checker, called NuSMV, developed as part of a
joint project between CMU and IRST. NuSMV is the result of the reengineering …

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 …

Search has been vital to artificial intelligence from the very beginning as a core technique in
problem solving. The authors present a thorough overview of heuristic search with a balance …

Reduction to SAT is a very successful approach to solving hard combinatorial problems in
Artificial Intelligence and computer science in general. Most commonly, problem instances …

LNAI 1809 - Planning as Model Checking Page 1 Planning as Model Checking Fausto
Giunchiglia1,2 and Paolo Traverso1 1 IRST, Istituto per la Ricerca Scientifica e Tecnologica …

In this paper we describe COLIN, a forward-chaining heuristic search planner, capable of
reasoning with COntinuous LINear numeric change, in addition to the full temporal …