Encoding planning problems in nonmonotonic logic programs
- 1 January 1997
- book chapter
- Published by Springer Nature
- p. 169-181
- https://doi.org/10.1007/3-540-63912-8_84
Abstract
No abstract availableKeywords
This publication has 5 references indexed in Scilit:
- Fast planning through planning graph analysisArtificial Intelligence, 1997
- Accelerating Partial-Order Planners: Some Techniques for Effective Search Control and PruningJournal of Artificial Intelligence Research, 1996
- WFS + branch and bound = stable modelsIEEE Transactions on Knowledge and Data Engineering, 1995
- Representing action and change by logic programsThe Journal of Logic Programming, 1993
- The well-founded semantics for general logic programsJournal of the ACM, 1991