Abstract
While there seems to be a general consensus about the expressive power of a number of language features in planning formalisms, one can find many different statements about the expressive power of disjunctive preconditions. Using the “compilability framework,” we show that preconditions in conjunctive normal form add to the expressive power of propositional strips, which confirms a conjecture by Bäckström. Further, we show that preconditions in conjunctive normal form do not add any expressive power once we have conditional effects.
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
Anderson, C.R., Smith, D.E., Weld, D.S.: Conditional effects in Graphplan. In: Simmons, R., Veloso, M., Smith, S. (eds.) Proceedings of the 4th International Conference on Artificial Intelligence Planning Systems (AIPS 1998), pp. 44–53. AAAI Press, Menlo Park (1998)
Bäckström, C.: Expressive equivalence of planning formalisms. Artificial Intelligence 76(1-2), 17–34 (1995)
Bylander, T.: The computational complexity of propositional STRIPS planning. Artificial Intelligence 69(1-2), 165–204 (1994)
Cadoli, M., Donini, F.M.: A survey on knowledge compilation. AI Communications 10(3,4), 137–150 (1997)
Gazen, B.C., Knoblock, C.: Combining the expressiveness of UCPOP with the efficiency of Graphplan. In: Steel and Alami [13], pp. 221–233
Kambhampati, S., Parker, E., Lambrecht, E.: Understanding and extending Graphplan. In: Steel and Alami [13], pp. 260–272
Karp, R.M., Lipton, R.J.: Turing machines than take advice. L’ Ensignement Mathématique 28, 191–210 (1982)
Kautz, H.A., Selman, B.: Forming concepts for fast inference. In: Proceedings of the 10th National Conference of the American Association for Artificial Intelligence (AAAI 1992), San Jose, CA, pp. 786–793. MIT Press, Cambridge (1992)
Köbler, J., Watanabe, O.: New collapse consequences of np having small circuits. SIAM Journal on Computing 28(1), 311–324 (1998)
Koehler, J., Nebel, B., Hoffmann, J., Dimopoulos, Y.: Extending planning graphs to an ADL subset. In: Steel and Alami [13], pp. 273–285
Nebel, B.: On the compilability and expressive power of propositional planning formalisms. Technical Report 101, Albert-Ludwigs-Universität, Institut für Informatik, Freiburg, Germany (June 1998)
Nebel, B.: Compilation schemes: A theoretical tool for assessing the expressive power of planning formalisms. In: Burgard, W., Cremers, A.B., Christaller, T. (eds.) KI 1999: Advances in Artificial Intelligence, Bonn, Germany. Springer, Heidelberg (1999) (to appear)
Steel, S., Alami, R. (eds.): ECP 1997. LNCS (LNAI), vol. 1348. Springer, Heidelberg (1997)
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
Nebel, B. (2000). What is the Expressive Power of Disjunctive Preconditions?. In: Biundo, S., Fox, M. (eds) Recent Advances in AI Planning. ECP 1999. Lecture Notes in Computer Science(), vol 1809. Springer, Berlin, Heidelberg. https://doi.org/10.1007/10720246_23
Download citation
DOI: https://doi.org/10.1007/10720246_23
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-67866-3
Online ISBN: 978-3-540-44657-6
eBook Packages: Springer Book Archive