Abstract. We propose a new declarative planning language, called K, which is based on principles and methods of logic programming. In this language, transitions between states of knowledge can be described, rather than transitions between completely described states of the world, which makes the language well-suited for planning under incomplete knowledge. Furthermore, it enables the use of default principles in the planning process by supporting negation as failure. Nonetheless, K also supports the representation of transitions between states of the world (i.e., states of complete knowledge) as a special case, which shows that the language is very flexible. As we demonstrate on particular examples, the use of knowledge states may allow for a natural and compact problem representation. We then provide a thorough analysis of the computational complexity of K, and consider different planning problems, including standard planning and secure planning (also known as conformant planning) problems. We show that these problems have different complexities under various restrictions, ranging from NP to NEXPTIME in the propositional case. Our results form the theoretical basis for the DLV K
|
1588
|
Computational Complexity
– Papadimitriou
- 1994
|
|
1397
|
STRIPS: A new approach in the application of theorem proving to problem solving
– Fikes, Nilsson
- 1971
|
|
1224
|
Some philosophical problems from the standpoint of arti cial intelligence
– McCarthy, Hayes
- 1969
|
|
740
|
Fast planning through planning graph analysis
– Blum, Furst
- 1995
|
|
594
|
Chaff: Engineering an efficient SAT solver
– Moskewicz, Madigan, et al.
- 2001
|
|
554
|
Classical negation in logic programs and disjunctive databases. New Generation Computing 9:365–385
– Gelfond, Lifschitz
- 1991
|
|
460
|
A logic-based calculus of events
– Kowalski, Sergot
- 1986
|
|
401
|
Golog: A logic programming language for dynamic domains
– Levesque, Reiter, et al.
- 1997
|
|
357
|
Representing action and change by logic programs
– Gelfond, Lifschitz
- 1993
|
|
278
|
Planning as satisfiability
– Kautz, Selman
- 1992
|
|
241
|
An algorithm for probabilistic planning
– Kushmerick, Hanks, et al.
- 1995
|
|
234
|
An Introduction to Least Commitment Planning
– Weld
- 1994
|
|
230
|
Nonmonotonic logic and temporal projection
– Hanks, McDermott
- 1987
|
|
212
|
Principles of Database and
– Ullman
- 1989
|
|
211
|
On closed world data bases
– Reiter
- 1978
|
|
201
|
Conditional nonlinear planning
– Peot, Smith
- 1992
|
|
200
|
Application of theorem proving to problem solving
– Green
- 1969
|
|
199
|
The computational complexity of propositional STRIPS planning
– Bylander
- 1994
|
|
190
|
Principles of Database and Knowledge Base Systems
– Ullman
- 1989
|
|
189
|
Logic programs with stable model semantics as a constraint programming paradigm
– Niemela
- 1999
|
|
182
|
Autoepistemic logic
– Marek, Truszczynski
- 1991
|
|
180
|
Unifying SAT-based and Graphbased planning
– Kautz, Selman
- 1999
|
|
166
|
Complexity and Expressive Power of Logic Programming
– Dantsin, Eiter, et al.
- 2001
|
|
157
|
Using CSP look-back techniques to solve real world SAT instances
– Bayardo, Schrag
- 1997
|
|
145
|
Planning with Incomplete Information as Heuristic Se arch
– Bonet, Geffner
|
|
145
|
SATO: an efficient propositional prover
– Zhang
- 1997
|
|
133
|
Causal theories of action and change
– McCain, Turner
- 1997
|
|
133
|
Extending graphplan to handle uncertainty and sensing actions
– Weld, Anderson, et al.
- 1998
|
|
123
|
Prediction is deduction but explanation is abduction
– Shanahan
- 1989
|
|
116
|
Constructing Conditional Plans by a Theorem Prover
– Rintanen
- 1999
|
|
112
|
Action languages
– Gelfond, Lifschitz
- 1998
|
|
108
|
An algorithm to evaluate quantified boolean formulae and its experimental evaluation
– Cadoli, Schaerf, et al.
|
|
105
|
Abductive planning with event calculus
– Eshghi
- 1988
|
|
104
|
An action language based on causal explanation: Preliminary report
– Giunchiglia, Lifschitz
- 1998
|
|
103
|
Actions with indirect effects (preliminary report
– Kartha, Lifschitz
- 1994
|
|
103
|
Answer Set Planning
– Lifschitz
- 1999
|
|
102
|
The KR System dlv: Progress Report, Comparisons and Benchmarks
– Eiter, Leone, et al.
- 1998
|
|
102
|
Complexity, decidability and undecidability results for domain-indepenedent planning
– Erol, Nau, et al.
- 1994
|
|
102
|
Conformant Graphplan
– Smith, Weld
- 1998
|
|
95
|
Conformant Planning via Symbolic Model Checking
– Cimatti, Roveri
- 2000
|
|
94
|
Consistency of Clark's completion and existence of stable models
– Fages
- 1994
|
|
92
|
A critique of pure reason
– McDermott
- 1987
|
|
88
|
Encoding planning problems in nonmonotonic logic programs
– Dimopoulos, Koehler, et al.
- 1997
|
|
88
|
Planning for contingencies: a decision-based approach
– Pryor, Collins
- 1996
|
|
85
|
Semantics of Logic Programs: Their Intuitions and Formal Properties. An Overview
– Dix
- 1995
|
|
84
|
An efficient propositional prover
– SATO
- 1997
|
|
69
|
Reprenting Actions in Logic Programs and Default Theories: A Situation Calculus Approach
– Turner
- 1997
|
|
66
|
Improvements to the evaluation of quantified boolean formulae
– Rintanen
|
|
64
|
Representing action: Indeterminacy and ramifications
– Giunchiglia, Kartha, et al.
- 1997
|
|
60
|
Formalization of common sense, papers by John McCarthy edited by
– McCarthy
- 1990
|
|
