Event Calculus Planning Revisited

  title={Event Calculus Planning Revisited},
  author={Murray Shanahan},
  booktitle={European Conference on Planning},
  • M. Shanahan
  • Published in
    European Conference on…
    24 September 1997
  • Mathematics
In 1969 Cordell Green presented his seminal description of planning as theorem proving with the situation calculus. The most pleasing feature of Green's account was the negligible gap between high-level logical specification and practical implementation. This paper attempts to reinstate the ideal of planning via theorem proving in a modern guise. In particular, I will show that if we adopt the event calculus as our logical formalism and employ abductive logic programming as our theorem proving… 

An abductive event calculus planner

The Nature of Knowledge in an Abductive Event Calculus Planner

It is claimed that a knowledge level analysis of problem-solving methods for planning, can help to identify what is the role of each piece of knowledge in a system and provide a common language to map, classify and compare different systems.

Planning with Incomplete Information

This paper proposes a planner, called the E-Planner, which is often able to extend an initial weak plan into a safe plan even though the (explicit) information available is incomplete, e.g. for cases where the initial state is not completely known.

Planning with sensing, concurrency, and exogenous events: logical framework and implementation

This paper adopts a formal framework derived from Propositional Dynamic Logics by exploiting their formal correspondence with Description Logics, and presents an extension of such a framework obtained by introducing both concurrency on primitive actions and autoepistemic operators for explicitly representing the robot’s epistemic state.

Probabilistic, Temporal Projections in ConGolog

This paper presents a framework representing time, concurrency, probabilistic belief, pr obabilistic action effects and complex plans, integrating and extending several previous proposal into a single formal framework that is applied to model and reason about the behavior of a mobile service robot.

Some Alternative Formulations of the Event Calculus

The Event Calculus is a narrative based formalism for reasoning about actions and change originally proposed in logic programming form by Kowalski and Sergot. In this paper we summarise how variants

Knowledge Assimilation and Proof Restoration Through the Addition of Goals

It is shown that any invalid part of a proof can be restored if some additional goals are solved, which can be added before a proof is completed.

ACLP: A case for Non-Monotonic Reasoning

These experiments provide evidence that the non-monotonic framework of ACLP does not compromise signiicantly the computational eeciency of the solutions thus connrming the computational viability of the framework for the development of exible solutions to complex applications.

Formalising the Common Sense of a Mobile Robot

Shana-han's logical account for a mobile robot is described and discussed, and the analysis of the computational complexity of the framework in question made it conclude that its complexity is at least complete for the second level of the polynomial hierarchy.



Planning for Conjunctive Goals

A Logical Approach to High-Level Robot Programming A Progress Report*

A novel approach to high-level robot programming based on a highly developed logica] theory of action, where the user provides a specification of the robot’s basic actions as well as of relevant aspects of the environment, in an extended version of the situation calculus.

Algorithm = logic + control

The notion that computation = controlled deduction was first proposed by Pay Hayes and more recently by Bibel and Vaughn-Pratt and the thesis that algorithms be regarded as consisting of both logic and control components is explored.

Using Meta-Logic to Reconcile Reactive with Rational Agents

The tools of meta-logic programming are used to deene the observation-thought-action cycle of an agent that combines the able to perform resource-bounded reasoning, which can be interrupted and resumed any time, with the ability to act when it is necessary.

UCPOP: A Sound, Complete, Partial Order Planner for ADL

It is proved ucpop is both sound and complete for this representation and a practical implementation that succeeds on all of Pednault's and McDermott's examples, including the infamous "Yale Stacking Problem".

Prediction is Deduction but Explanation is Abduction

An approach to temporal reasoning in which prediction is deduction but explanation is abduction is presented, which results in a form of default persistence which correctly handles problems which have troubled other formulations.