Concurrency and Plan Generation in a Logic Programming Language with a Sequential Operator

In this paper we deene a logic programming language, called SMR, whose main computational mechanism is multiset rewriting. It features a guarded choice capability and, above all, a sequential and-like operator. The language is deened starting from a core language, LM, a subset of Andreoli and Pareschi's LO, which is directly derived from linear logic. LM is minimal in a certain sense we will specify. The language SMR admits a translation into LM through a uniform \continuation" mechanism. We show how SMR could be interesting in two diverse areas, viz. concurrency and plan generation.

[1]  Jean Gallier,et al.  Constructive Logics Part I: A Tutorial on Proof Systems and Typed gamma-Calculi , 1993, Theor. Comput. Sci..

[2]  Jean-Marc Andreoli,et al.  Interaction abstract machines , 1993 .

[3]  Michael Thielscher,et al.  Equational Logic Programming Actions, and Change , 1992, JICSLP.

[4]  Jacqueline Vauzeilles,et al.  Generating Plans in Linear Logic , 1990, FSTTCS.

[5]  James Harland,et al.  A Uniform Proof-Theoretic Investigation of Linear Logic Programming , 1994, J. Log. Comput..

[6]  Jean-Marc Andreoli,et al.  Linear objects: Logical processes with built-in inheritance , 1990, New Generation Computing.

[7]  Gérard Berry,et al.  The chemical abstract machine , 1989, POPL '90.

[8]  J. Gallier.  Constructive Logics. Part II: Linear Logic and Proof Nets , 1991 .

[9]  John McCarthy,et al.  SOME PHILOSOPHICAL PROBLEMS FROM THE STANDPOINT OF ARTI CIAL INTELLIGENCE , 1987 .

[10]  Andrea Corradini,et al.  A Categorial Model for Logic Programs: Indexed Monoidal Categories , 1992, REX Workshop.

[11]  Daniel Le Métayer,et al.  The GAMMA Model and Its Discipline of Programming , 1990, Sci. Comput. Program..

[12]  Antonio Brogi,et al.  AND-Parallelism without Shared Variables , 1990, International Conference on Logic Programming.

[13]  JEAN-MARC ANDREOLI,et al.  Logic Programming with Focusing Proofs in Linear Logic , 1992, J. Log. Comput..

[14]  Ugo Montanari,et al.  An Algebraic Semantics for Structured Transition Systems and its Applications to Logic Programs , 1992, Theor. Comput. Sci..

[15]  J. Girard.  Proof Theory and Logical Complexity , 1989 .

[16]  Giorgio Levi,et al.  A Synchronization Logic: Axiomatics and Formal Semantics of Generalized Horn Clauses , 1984, Inf. Control..

[17]  Dale Miller.  The pi-Calculus as a Theory in Linear Logic: Preliminary Results , 1992, ELP.

[18]  Wolfgang Reisig.  Petri Nets: An Introduction , 1985, EATCS Monographs on Theoretical Computer Science.

[19]  Gopalan Nadathur,et al.  Uniform Proofs as a Foundation for Logic Programming , 1991, Ann. Pure Appl. Log..

[20]  José Meseguer,et al.  Conditioned Rewriting Logic as a United Model of Concurrency , 1992, Theor. Comput. Sci..

[21]  Gerhard Gentzen,et al.  Investigations into Logical Deduction , 1970 .

[22]  José Meseguer,et al.  From Petri Nets to Linear Logic through Categories: A Survey , 1991, Int. J. Found. Comput. Sci..