Efficiently Implementing GOLOG with Answer Set Programming

In this paper we investigate three different approaches to encoding domain-dependent control knowledge for Answer-Set Planning. Starting with a standard implementation of the action description language B, we add control knowledge expressed in the GOLOG logic programming language. A naive encoding, following the original definitions of Levesque et al., is shown to scale poorly. We examine two alternative codings based on the transition semantics of ConGOLOG. We show that a speed increase of multiple orders of magnitude can be obtain by compiling the GOLOG program into a finitestate machine representation.

[1]  Tran Cao Son,et al.  Domain-dependent knowledge in answer set planning , 2002, TOCL.

[2]  Bell Telephone,et al.  Regular Expression Search Algorithm , 1968 .

[3]  Alex M. Andrew,et al.  Knowledge in Action: Logical Foundations for Specifying and Implementing Dynamical Systems , 2002 .

[4]  Fahiem Bacchus,et al.  Using temporal logics to express search control knowledge for planning , 2000, Artif. Intell..

[5]  Hector J. Levesque,et al.  GOLOG: A Logic Programming Language for Dynamic Domains , 1997, J. Log. Program..

[6]  Ken Thompson,et al.  Programming Techniques: Regular expression search algorithm , 1968, Commun. ACM.

[7]  Michael Thielscher.  Action Programming Languages , 2008, Action Programming Languages.

[8]  Martin Gebser,et al.  Answer Set Solving in Practice , 2012, Answer Set Solving in Practice.

[9]  Hector J. Levesque,et al.  ConGolog, a concurrent programming language based on the situation calculus , 2000, Artif. Intell..

[10]  Marius Thomas Lindauer,et al.  Potassco: The Potsdam Answer Set Solving Collection , 2011, AI Commun..

[11]  Michael Gelfond,et al.  Action Languages , 1998, Electron. Trans. Artif. Intell..

[12]  Patrick Doherty,et al.  TALplanner: an empirical investigation of a temporal logic-based forward chaining planner , 1999, Proceedings. Sixth International Workshop on Temporal Representation and Reasoning. TIME-99.

[13]  Hector Muñoz-Avila,et al.  SHOP: Simple Hierarchical Ordered Planner , 1999, IJCAI.

[14]  Gerhard Lakemeyer,et al.  Towards an Integration of Golog and Planning , 2007, IJCAI.

[15]  Jozef Jirásek,et al.  Deterministic Blow-Ups of Minimal Nondeterministic Finite Automata over a Fixed Alphabet , 2007, Developments in Language Theory.