Planning with Incomplete Information in Quantified Answer Set Programming
Open Access
- 24 September 2021
- journal article
- research article
- Published by Cambridge University Press (CUP) in Theory and Practice of Logic Programming
- Vol. 21 (5) , 663-679
Abstract
We present a general approach to planning with incomplete information in Answer Set Programming (ASP). More precisely, we consider the problems of conformant and conditional planning with sensing actions and assumptions. We represent planning problems using a simple formalism where logic programs describe the transition function between states, the initial states and the goal states. For solving planning problems, we use Quantified Answer Set Programming (QASP), an extension of ASP with existential and universal quantifiers over atoms that is analogous to Quantified Boolean Formulas (QBFs). We define the language of quantified logic programs and use it to represent the solutions different variants of conformant and conditional planning. On the practical side, we present a translation-based QASP solver that converts quantified logic programs into QBFs and then executes a QBF solver, and we evaluate experimentally the approach on conformant and conditional planning benchmarks.Keywords
All Related Versions
This publication has 21 references indexed in Scilit:
- Blocked Clause Elimination for QBF2011
- Approximation of action theories and its application to conformant planningArtificial Intelligence, 2011
- Answer Set Programming without Unstratified Negation2008
- Reasoning and planning with sensing actions, incomplete information, and static causal laws using answer set programmingTheory and Practice of Logic Programming, 2007
- Mapping Conformant Planning into SAT Through Compilation and Projection2006
- An Approximation of Action Theories of $\mathcal{AL}$ and Its Application to Conformant PlanningLecture Notes in Computer Science, 2005
- SAT-based planning in complex domains: Concurrency, constraints and nondeterminismArtificial Intelligence, 2003
- A logic programming approach to knowledge-state planning, II: The systemArtificial Intelligence, 2003
- Polynomial-Length Planning Spans the Polynomial HierarchyLecture Notes in Computer Science, 2002
- Answer set programming and plan generationArtificial Intelligence, 2002