Specifying and implementing dynamical systems with the situation calculus. Modeling and
implementing dynamical systems is a central problem in artificial intelligence, robotics …

The goal of this paper is to test if a programming methodology based on the declarative
language A-Prolog and the systems for computing answer sets of such programs, can be …

In Part I of this series of papers, we have proposed a new logic-based planning language,
called K. This language facilitates the description of transitions between states of knowledge …

In this paper we tackle the problem of Conformant Planning: find a sequence of actions that
guarantees goal achievement regardless of an uncertain initial condition and of …

We propose a new declarative planning language, called K, which is based on principles
and methods of logic programming. In this language, transitions between states of …

Planning as satisfiability is a very efficient technique for classical planning, ie, for planning
domains in which both the effects of actions and the initial state are completely specified. In …

The situation calculus, as proposed by McCarthy and Hayes, and developed over the last
decade by Reiter and co-workers, is reconsidered. A new logical variant called ES is …

The situation calculus, as proposed by McCarthy and Hayes, and developed over the last
decade by Reiter and co-workers, is reconsidered. A new logical variant is proposed that …

This paper presents an approach to artificial intelligence planning based on linear temporal
logic (LTL). A simple and easy-to-use planning language is described, Planning Domain …

Planning in nondeterministic domains has gained more and more importance. Conformant
planning is the problem of finding a sequential plan that guarantees the achievement of a …