What is the expressive power of disjunctive preconditions?

Lecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science)

Volumn 1809, Issue , 2000, Pages 294-307

  Nebel, Bernhard ^a  

^a UNIVERSITY OF FREIBURG   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTERS;

COMPILABILITY; CONDITIONAL EFFECTS; CONJUNCTIVE NORMAL FORMS; EXPRESSIVE POWER; LANGUAGE FEATURES; PLANNING FORMALISM;

BOOLEAN FUNCTIONS;

EID: 84943338982     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/10720246_23     Document Type: Conference Paper

References (13)

1. C.R.Anderson, D.E.Smith, and D.S.Weld.Conditional eects in Graphplan.In R.Simmons, M.Veloso, and S.Smith, editors, Proceedings of the 4th International Conference on Artificial Intelligence Planning Systems (AIPS-98), pages 44-53.AAAI Press, Menlo Park, 1998.
2. C.Bäckström.Expressive equivalence of planning formalisms.Artificial Intelligence, 76(1-2):17-34, 1995.
3. T.Bylander.The computational complexity of propositional STRIPS planning.Artificial Intelligence, 69(1-2):165-204, 1994.
4. M.Cadoli and F.M.Donini.A survey on knowledge compilation.AI Communications, 10(3, 4):137-150, 1997.
5. B.C.Gazen and C.Knoblock.Combining the expressiveness of UCPOP with the eciency of Graphplan.In Steel and Alami [13], pages 221-233.
6. S.Kambhampati, E.Parker, and E.Lambrecht.Understanding and extending Graphplan.In Steel and Alami [13], pages 260-272.
7. R.M.Karp and R.J.Lipton.Turing machines than take advice.L' Ensignement Mathfiematique, 28:191-210, 1982.
8. H.A.Kautz and B.Selman.Forming concepts for fast inference.In Proceedings of the 10th National Conference of the American Association for Artificial Intelligence (AAAI-92), pages 786-793, San Jose, CA, July 1992.MIT Press.
9. J.Köbler and O.Watanabe.New collapse consequences of np having small circuits.SIAM Journal on Computing, 28(1):311-324, 1998.
10. J.Koehler, B.Nebel, J.Homann, and Y.Dimopoulos.Extending planning graphs to an ADL subset.In Steel and Alami [13], pages 273-285.
11. B.Nebel.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.
12. B.Nebel.Compilation schemes: A theoretical tool for assessing the expressive power of planning formalisms.In W.Burgard, A.B.Cremers, and T.Christaller, editors, KI-99: Advances in Artificial Intelligence, Bonn, Germany, 1999.Springer-Verlag.To appear.
13. S.Steel and R.Alami, editors.Recent Advances in AI Planning.4th European Conference on Planning (ECP'97), volume 1348 of Lecture Notes in Artificial Intelligence, Toulouse, France, Sept.1997.Springer-Verlag