Abstract
We propose a new logic-based planning language, called \( \mathcal{K} \). Transitions between states of knowledge can be described in \( \mathcal{K} \), and the language is well suited for planning under incomplete knowledge. Nonetheless, \( \mathcal{K} \) also supports the representation of transitions between states of the world (i.e., states of complete knowledge) as a special case, proving to be very flexible. A planning system supporting \( \mathcal{K} \) is implemented on top of the disjunctive logic programming system DLV. This novel system allows for solving hard planning problems, including secure planning under incomplete initial states, which cannot be solved at all by other logic-based planning systems such as traditional satisfiability planners.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
C. Baral, V. Kreinovich, and R. Trejo. Computational complexity of planning and approximate planning in presence of incompleteness. IJCAI’ 99, pp. 948–953.
T. Bylander. The Computational Complexity of Propositional STRIPS Planning. AIJ, 69:165–204, 1994.
A. Cimatti, M. Roveri. Conformant Planning via Model Checking. Proc. ECP’99, LNCS, 1999.
T. Eiter, N. Leone, C. Mateis, G. Pfeifer, and F. Scarcello. The KR System dlv: Progress Report, Comparisons and Benchmarks. KR’98, pp. 406–417.
W. Faber, N. Leone, and G. Pfeifer. Pushing Goal Derivation in DLP Computations. LPNMR’99, pp. 177–191.
R. E. Fikes and N. J. Nilsson. Strips: A new approach to the application of theorem proving to problem solving. AIJ, 2(3–4):189–208, 1971.
M. Gelfond and V. Lifschitz. Classical Negation in Logic Programs and Disjunctive Databases. NGC, 9:365–385, 1991.
M. Gelfond and V. Lifschitz. Representing Action and Change by Logic Programs. JLP, 17:301–321, 1993.
E. Giunchiglia. Planning as Satisfiability with Expressive Action Languages: Concurrency, Constraints and Nondeterminism. KR’ 00.
E. Giunchiglia, G. Neelakantan Kartha, and V. Lifschitz. Representing action: Indeterminacy and ramifications. AIJ, 95:409–443, 1997.
E. Giunchiglia and V. Lifschitz. An Action Language Based on Causal Explanation: Preliminary Report. AAAI’ 98, pp. 623–630.
E. Giunchiglia and V. Lifschitz. Action languages, temporal action logics and the situation calculus. IJCAI’99 Workshop on Nonmonotonic Reasoning, Action, and Change.
S. Hanks and D. McDermott. Nonmonotonic Logic and Temporal Projection. AIJ, 33(3):379–412, 1987.
L. Iocchi, D. Nardi, and R. Rosati. Planning with sensing, concurrency, and exogenous events: Logical framework and implementation. KR’2000.
G. Neelakantan Kartha and V. Lifschitz. Actions with indirect effects. KR’ 94, pp. 341–350.
H. Kautz and B. Selman. Unifying SAT-based and Graph-based Planning. IJCAI’ 99, pp. 318–325.
N. Kushmerick, S. Hanks and D. Weld. An algorithm for probabilistic planning. Artificial Intelligence, 76(1–2), pp. 239–286, 1996.
V. Lifschitz and H. Turner. Representing transition systems by logic programs. LPNMR’99, pp. 92–106.
V. Lifschitz. Action Languages, Answer Sets and Planning. The Logic Programming Paradigm-A 25-Year Perspective. Springer, 1999.
V. Lifschitz. Answer set planning. ICLP’ 99, pp. 23–37.
N. McCain. Using the Causal Calculator with the C Input Language. Unpublished draft, 1999.
J. McCarthy. Formalization of common sense, papers by John McCarthy edited by V. Lifschitz. Ablex, 1990.
N. McCain, H. Turner. Fast Satisfiability Planning with Causal Theories. KR’98.
J. McCarthy and P.J. Hayes. Some philosophical problems from the standpoint of artificial intelligence. Machine Intelligence 4.
I. Niemelä. Logic Programs with Stable Model Semantics as a Constraint Programming Paradigm. AMAI, 25(3–4):241–273, 1999.
M. Peot. Decision-theoretic planning. PhD thesis, Dept. of Engineering and Economic Systems, Stanford University, 1998.
M. Peot and D. Smith. Conditional nonlinear planning. In Proc. of AIPS’92, pp. 189–197, 1992.
L. Pryor and G. Collins. Planning for contingencies: a decision-based approach. Journal of Artificial Intelligence Research, 4:287–339, 1996.
R. Reiter. Open world planning in the situation calculus. To appear in Proc. of AAAI 2000.
J. Rintanen. Constructing Conditional Plans by a Theorem-Prover. Journal of Artificial Intelligence Research, 10:323–352, 1999.
S.J. Russel and P. Norvig. Artificial Intelligence, A Modern Approach. Prentice-Hall, Inc., 1995.
D. Smith and D. Weld. Conformant Graphplan. In Proc. of AAAI’98, 1998.
G.J. Sussman. The Virtuous Nature of Bugs. Readings in Planning, chapter 3. Morgan Kaufmann, 1990. Originally written 1974.
H. Turner. Representing Actions in Logic Programs and Default Theories: A Situation Calculus Approach, JLP, 31:245–298, 1997.
J. D. Ullman. Principles of Database and Knowledge Base Systems, volume 1. Computer Science Press, 1989.
M. Veloso. Nonlinear problem solving using intelligent causal-commitment. Technical Report CMU-CS-89-210, Carnegie Mellon University, 1989.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Eiter, T., Faber, W., Leone, N., Pfeifer, G., Polleres, A. (2000). Planning under Incomplete Knowledge. In: Lloyd, J., et al. Computational Logic — CL 2000. CL 2000. Lecture Notes in Computer Science(), vol 1861. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44957-4_54
Download citation
DOI: https://doi.org/10.1007/3-540-44957-4_54
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-67797-0
Online ISBN: 978-3-540-44957-7
eBook Packages: Springer Book Archive