Automated planning with ontologies under coherence update semantics

πŸ“… 2025-07-20
πŸ“ˆ Citations: 0
✨ Influential: 0
πŸ“„ PDF
πŸ€– AI Summary
This paper addresses the challenge of integrating background knowledge and action models in ontology-aware automated planning. We propose a novel planning framework grounded in DL-Lite ontologies and consistency-updating semantics. The framework uniformly models action preconditions and effects from explicit Knowledge Base (eKAB) specifications alongside ontological constraints, ensuring logically consistent state evolution while preserving the open-world assumption. Our key contribution is a polynomial-time compilation algorithm that reduces ontology-aware planning problems to classical planning instances, guaranteeing computational complexity no higher than that of standard classical planners. We empirically validate the efficiency and scalability of our approach on both established and newly constructed benchmarks. Furthermore, we implement a fully functional prototype system demonstrating practical applicability.

Technology Category

Application Category

πŸ“ Abstract
Standard automated planning employs first-order formulas under closed-world semantics to achieve a goal with a given set of actions from an initial state. We follow a line of research that aims to incorporate background knowledge into automated planning problems, for example, by means of ontologies, which are usually interpreted under open-world semantics. We present a new approach for planning with DL-Lite ontologies that combines the advantages of ontology-based action conditions provided by explicit-input knowledge and action bases (eKABs) and ontology-aware action effects under the coherence update semantics. We show that the complexity of the resulting formalism is not higher than that of previous approaches and provide an implementation via a polynomial compilation into classical planning. An evaluation of existing and new benchmarks examines the performance of a planning system on different variants of our compilation.
Problem

Research questions and friction points this paper is trying to address.

Incorporating ontologies into automated planning problems
Combining ontology-based action conditions and effects
Evaluating complexity and performance of new planning approach
Innovation

Methods, ideas, or system contributions that make the work stand out.

DL-Lite ontologies for automated planning
Coherence update semantics for action effects
Polynomial compilation into classical planning
πŸ”Ž Similar Papers
No similar papers found.
S
Stefan Borgwardt
Institute of Theoretical Computer Science, TU Dresden, Germany
D
Duy Nhu
Institute of Theoretical Computer Science, TU Dresden, Germany
Gabriele RΓΆger
Gabriele RΓΆger
University of Basel, Switzerland
Artificial IntelligenceAutomated PlanningHeuristic Search