Generalized planning studies the representation, computation and evaluation of solutions
that are valid for multiple planning instances. These are topics studied since the early days …

In discrete dynamical systems change results from actions. As such, given a set of
observations, diagnoses often take the form of posited events that result in the observed …

Generalized planning is the task of generating a single solution (a generalized plan) that is
valid for multiple planning instances. In this paper we introduce a novel formalism for …

Action programming languages like Golog allow to define complex behaviors for agents on
the basis of action representations in terms of expressive (first-order) logical formalisms …

Abstract Knowledge-based programs contain both world-altering actions, which upon
execution change the state of the world, and sensing actions, which upon execution change …

Planning as theorem proving in situation calculus was abandoned 50 years ago as an
impossible project. But we have developed a Theorem Proving Lifted Heuristic (TPLH) …

Autonomous agents transcend their individual capabilities by cooperating towards achieving
shared goals. The different viewpoints agents have on the environment cause …

Planning as heuristic search is one of the most successful approaches to classical planning
but unfortunately, it does not trivially extend to Generalized Planning (GP); GP aims to …

Research in automated planning traditionally focuses on model-based approaches that
often sacrifice expressivity for computational efficiency. For artificial agents that operate in …

This paper introduces a general approach for synthesizing procedural models of the state-
transitions of a given discrete system. The approach is general in that it accepts different …