Planning with Transaction Logic

• Published in: Web Reasoning and Rule Systems pp. 29 - 44
• Main Authors: Basseda, Reza, Kifer, Michael, Bonner, Anthony J.
• Format: Book Chapter
• Language: English
• Published: Cham Springer International Publishing 2014
• Series: Lecture Notes in Computer Science
• Subjects: Inference Rule; Logic Programming; Predicate Symbol; Reachability Query; Transaction Logic
• ISBN: 9783319111124; 3319111124
• ISSN: 0302-9743; 1611-3349
• DOI: 10.1007/978-3-319-11113-1_3

Automated planning has been the subject of intensive research and is at the core of several areas of AI, including intelligent agents and robotics. In this paper, we argue that Transaction Logic is a natural specification language for planning algorithms, which enables one to see further afield and thus discover better and more general solutions than using one-of-a-kind formalisms. Specifically, we take the well-known ${\textit{STRIPS}}$ planning strategy and show that Transaction Logic lets one specify the ${\textit{STRIPS}}$ planning algorithm easily and concisely, and to prove its completeness. Moreover, extensions to allow indirect effects and to support action ramifications come almost for free. Finally, the compact and clear logical formulation of the algorithm made possible by this logic is conducive to fruitful experimentation. To illustrate this, we show that a rather simple modification of the ${\textit{STRIPS}}$ planning strategy is also complete and yields speedups of orders of magnitude.