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 …

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 …

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 …

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 …

Abstract Systems subject to (continuous) physical effects and controlled by (discrete) digital
equipments, are today very common. Thus, many realistic domains where planning is …

Quantified Boolean logic results from adding operators to Boolean logic for existentially and
universally quantifying variables. This extends the reach of Boolean logic by enabling a …

Most real world environments are non-deterministic. Automatic plan formation in non-
deterministic dommns is, however, still an open problem. In this paper we present a practical …

Abstract The Model Based Planner (MBP) is a system for planning in non-deterministic
domains. It can generate plans automatically to solve various planning problems, like …

It is essential for users to understand what their AI systems can and can't do in order to use
them safely. However, the problem of enabling users to assess AI systems with sequential …

Rarely planning domains are fully observable. For this reason, the ability to deal with partial
observability is one of the most important challenges in planning. In this paper, we tackle the …