# A Logical Semantics for PDDL+

arXiv: https://arxiv.org/abs/2111.11588 · HTML: https://mlsanity.com/paper/2111.11588/

## Key facts

- Cited by 1 papers in the map (data through 14 Oct 2026).
- Builds on 4 of its 33 references that are in the map.
- First posted on arXiv 23 Nov 2021.

## Builds on (most cited first, 4 of 4)

- [Bounded Situation Calculus Action Theories](https://mlsanity.com/paper/1509.02012/) (2015)
- [Plan-based Policies for Efficient Multiple Battery Load Management](https://mlsanity.com/paper/1401.5859/) (2014)
- [PDDL+ Planning via Constraint Answer Set Programming](https://mlsanity.com/paper/1609.00030/) (2016)
- [Hybrid Temporal Situation Calculus](https://mlsanity.com/paper/1807.04861/) (2018)

## Built on by (most cited first, 1 of 1)

- [Planning as Theorem Proving with Heuristics](https://mlsanity.com/paper/2303.13638/) (2023)

## Abstract (arXiv)

PDDL+ is an extension of PDDL2.1 which incorporates fully-featured autonomous processes and allows for better modelling of mixed discrete-continuous domains. Unlike PDDL2.1, PDDL+ lacks a logical semantics, relying instead on state-transitional semantics enriched with hybrid automata semantics for the continuous states. This complex semantics makes analysis and comparisons to other action formalisms difficult. In this paper, we propose a natural extension of Reiter's situation calculus theories inspired by hybrid automata. The kinship between PDDL+ and hybrid automata allows us to develop a direct mapping between PDDL+ and situation calculus, thereby supplying PDDL+ with a logical semantics and the situation calculus with a modern way of representing autonomous processes. We outline the potential benefits of the mapping by suggesting a new approach to effective planning in PDDL+.