Corpus ID: 16757659

A Situation-Calculus Semantics for an Expressive Fragment of PDDL

  title={A Situation-Calculus Semantics for an Expressive Fragment of PDDL},
  author={Jens Cla{\ss}en and Yuxiao Hu and G. Lakemeyer},
The Planning Domain Definition Language (PDDL) has become a common language to specify planning problems, facilitating the formulation of benchmarks and a direct comparison of planners. Over the years PDDL has been extended beyond STRIPS and ADL in various directions, for example, by adding time and concurrent actions. The current semantics of PDDL is purely meta-theoretic and quite complex, which makes an analysis difficult. Moreover, relating the language to other action formalisms is also… Expand
Planning and Verification in the agent language Golog
This thesis proposes an integration of Golog and planning where planning subtasks encountered during the execution of a Golog program are referred to a PDDL planner, thus combining Golog’s expressiveness with the efficiency of modern planners. Expand
Platas—Integrating Planning and the Action Language Golog
The theoretical foundation is laid by a mapping between the planning language Pddl and the Situation Calculus, which is underlying Golog, together with a study of how these formalisms relate in terms of expressivity. Expand
A Fluent Calculus Semantics for ADL with Plan Constraints
This work provides a purely declarative semantics for this PDDL fragment consisting of basic ADL extended by plan constraints by interpreting it in the basic Fluent Calculus, obtaining a logical semantics instead of the usual meta-theoretical state transition semantics. Expand
A Logical Semantics for PDDL+
A natural extension of Reiter’s situation calculus theories inspired by hybrid automata is proposed, thereby supplying PDDL+ with a logical semantics and the situation calculus with a modern way of representing autonomous processes. Expand
Temporally-Expressive Planning as Constraint Satisfaction Problems
An alternative view of temporal planning is proposed by investigating a new declarative semantics of PDDL, and a natural encoding of this semantics in a constraint programming setting is shown that can solve more general planning problems than the current state-of-the-art. Expand
The Nondeterministic Situation Calculus
The standard situation calculus assumes that atomic actions are deterministic. But many domains involve nondeterministic actions, with problems such as fully observable nondeterministic (FOND)Expand
Organic Synthesis as Artificial Intelligence Planning
A novel approach for logical representation of notions in organic chemistry, as well as for reasoning about generic chemical reactions, is presented and shows that expressive logical language can be useful for semantic modeling. Expand
A I ] 1 2 Ju l 2 01 8 Hybrid Temporal Situation Calculus
The ability to model continuous change in Reiter’s temporal situation calculus action theories has attracted a lot of interest. In this paper, we propose a new development of his approach, which isExpand
Robot Teams for Multi-Objective Tasks
This dissertation addresses the problem of producing rational behaviors for a team of agents pursuing possibly different objectives by defining a novel solution concept which is the first refinement of Pareto optimality for any multi-objective problem. Expand
Diagnosis as Planning Revisited
The characterization of diagnosis is extended to deal with the case of incomplete information, and rich preferences, and the use of state-of-the-art planning technology for the automated generation of diagnoses is explored. Expand


Towards an Integration of Golog and Planning
An integration of Golog and planning is proposed in the sense that planning problems, formulated as part of a Golog program, are solved by a modern planner during the execution of the program. Expand
Temporal reasoning in the situation calculus
A fundamental problem in Knowledge Representation is the design of a logical language to express theories about actions and change. One of the most prominent proposals for such a language is JohnExpand
PDDL2.1: An Extension to PDDL for Expressing Temporal Planning Domains
The syntax of the language, PDDL2.1, is described, which has considerable modelling power -- exceeding the capabilities of current planning technology -- and presents a number of important challenges to the research community. Expand
Semantics for a useful fragment of the situation calculus
It is argued that the fragment of the situation calculus represented by ES is rich enough to handle the basic action theories defined by Reiter as well as Golog and it is shown that in the full second-order version of ES, almost all of the scenario calculus can be accommodated. Expand
When is Temporal Planning Really Temporal?
A complete state-space temporal planning algorithm is designed, which the authors hope will be able to achieve high performance by leveraging the heuristics that power decision epoch planners. Expand
On the Compilability and Expressive Power of Propositional Planning Formalisms
  • B. Nebel
  • Computer Science, Mathematics
  • J. Artif. Intell. Res.
  • 2000
This work formalizes the intuition that expressive power is a measure of how concisely planning domains and plans can be expressed in a particular formalism by introducing the notion of compilation schemes between planning formalism, and analyzes the expressiveness of a large family of propositional planning formalisms. Expand
PDDL-the planning domain definition language
This manual describes the syntax of PDDL, the Planning Domain Definition Language, the problem-specification language for the AIPS-98 planning competition, and hopes to encourage empirical evaluation of planner performance, and development of standard sets of problems all in comparable notations. Expand
cc-Golog: Towards More Realistic Logic-Based Robot Controllers
High-level robot controllers in realistic domains typically deal with processes which operate concurrently, change the world continuously, and where the execution of actions is event-driven as inExpand
Natural Actions, Concurrency and Continuous Time in the Situation Calculus
This paper shows how to gracefully accommodate all features within the situation calculus, without sacri-cing the simple solution to the frame problem of Reiter 25]. Expand
How to Progress a Database
This paper considers the general problem of progressing an initial database in response to a given sequence of actions and appeals to the situation calculus and an axiomatization of actions which addresses the frame problem. Expand