Encoding of Planning Problems and Their Optimizations in Linear Logic

Girard's Linear Logic is a formalism which can be used to manage a lot of problems with consumable resources. Its expressiveness is quite good for an easily understandable encoding of many problems. We concentrated on expressing planning problems by linear logic in this paper. We observed a rich usage of a construct of consumable resources in planning problem formulations. This fact motivates us to provide a possible encoding of planning problems in linear logic. This paper shows how planning problems can be encoded in Linear Logic and how some optimizations of planning problems can be encoded. These optimizations can help planners to improve the efficiency of finding solutions (plans).

[1]  Lukás Chrpa,et al.  Towards Getting Domain Knowledge: Plans Analysis through Investigation of Actions Dependencies , 2008, FLAIRS.

[2]  M. Nivat.  Fiftieth volume of theoretical computer science , 1988 .

[3]  Thomas Ehrhard,et al.  Linear logic in computer science , 2004 .

[4]  番原 睦則,et al.  Design and implementation of linear logic programming languages , 2002 .

[5]  Makoto Tanabe,et al.  Timed Petri Nets and Temporal Linear Logic , 1997, ICATPN.

[6]  Bart Selman,et al.  Planning as Satisfiability , 1992, ECAI.

[7]  José Meseguer,et al.  From Petri Nets to Linear Logic , 1989, Category Theory and Computer Science.

[8]  Narciso Martí-Oliet,et al.  From Petri nets to linear logic , 1989, Mathematical Structures in Computer Science.

[9]  Peep Küngas.  Linear Logic for Domain-Independent AI Planning ( Extended Abstract ) , 2003 .

[10]  Peep Küngas.  Analysing AI Planning Problems in Linear Logic - A Partial Deduction Approach , 2004, SBIA.

[11]  L. Chrpa.  Linear Logic in Planning , 2006 .

[12]  Jean-Yves Girard,et al.  Linear logic: its syntax and semantics , 1995 .

[13]  Jussi Rintanen,et al.  Planning via Petri Net Unfolding , 2007, IJCAI.

[14]  J. S. Hodas.  Logic programming in intuitionistic linear logic: theory, design, and implementation , 1995 .

[15]  Stefan Edelkamp,et al.  Automated Planning: Theory and Practice , 2007, Künstliche Intell..

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

[17]  Richard E. Korf,et al.  Macro-Operators: A Weak Method for Learning , 1985, Artif. Intell..

[18]  Patrick Doherty,et al.  TALplanner: A Temporal Logic-Based Planner , 2001, AI Mag..

[19]  Paolo Traverso,et al.  Automated Planning: Theory & Practice , 2004 .

[20]  Dale Miller,et al.  Logic Programming in a Fragment of Intuitionistic Linear Logic , 1994, Inf. Comput..

[21]  Jacqueline Vauzeilles,et al.  Generating Plans in Linear Logic I. Actions as Proofs , 1993, Theor. Comput. Sci..

[22]  Patrick Lincoln,et al.  Linear logic , 1992, SIGA.

[23]  Éric Jacopin.  Classical AI Planning as Theorem Proving: The Case of a Fragment of Linear Logic , 1993 .

[24]  Alan Smaill,et al.  Deductive Synthesis of Recursive Plans in Linear Logic , 1999, ECP.

[25]  Bertram Fronhöfer,et al.  Plan Generation by Linear Proofs: On Semantics , 1989, GWAI.

[26]  Michael Thielscher,et al.  Under Consideration for Publication in Theory and Practice of Logic Programming Flux: a Logic Programming Method for Reasoning Agents , 2003 .

[27]  Naoyuki Tamura,et al.  User's Guide of a Linear Logic Theorem Prover (llprover) , 1998 .