RASP and ASP as a fragment of linear logic

Abstract RASP is a recent extension to Answer Set Programming (ASP) that permits declarative specification and reasoning on the consumption and production of resources. ASP can be seen as a particular case of RASP. In this paper, we study the relationship between linear logic and RASP problem specification. We prove that RASP programs can be translated into (a fragment of) linear logic, and vice versa. In doing so, we introduce a linear logic representation of default negation as understood in ASP. We are also able to establish a link between linear logic and here-and-there (HT) logic.

[1]  Serenella Cerrito,et al.  A Linear Axiomatization of Negation as Failure , 1992, J. Log. Program..

[2]  José Juan Palacios Pérez On strong negation as linear duality , 2006, LA-NMR.

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

[4]  Stefania Costantini,et al.  Extending and Implementing RASP , 2010, Fundam. Informaticae.

[5]  David Pearce,et al.  Strongly equivalent logic programs , 2001, ACM Trans. Comput. Log..

[6]  Michael Gelfond,et al.  Defeasible Laws, Parallel Actions, and Reasoning about Resources , 2007, AAAI Spring Symposium: Logical Formalizations of Commonsense Reasoning.

[7]  Jürgen Dix,et al.  A Classification Theory of Semantics of Normal Logic Programs: I. Strong Properties , 1995, Fundam. Informaticae.

[8]  Stefania Costantini,et al.  Modeling preferences and conditional preferences on resource consumption and production in ASP , 2009, J. Algorithms.

[9]  J. Lloyd Foundations of Logic Programming , 1984, Symbolic Computation.

[10]  Diego Calvanese,et al.  The Description Logic Handbook , 2007 .

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

[12]  Reijo Sulonen,et al.  Representing Configuration Knowledge With Weight Constraint Rules , 2001, Answer Set Programming.

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

[14]  Stefania Costantini,et al.  Answer Set Programming with Resources , 2010, J. Log. Comput..

[15]  Dale Miller,et al.  An Overview of Linear Logic Programming , 2003 .

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

[17]  Stefania Costantini,et al.  Under Consideration for Publication in Theory and Practice of Logic Programming on the Existence of Stable Models of Non-stratified Logic Programs , 2022 .

[18]  David Pearce,et al.  A New Logical Characterisation of Stable Models and Answer Sets , 1996, NMELP.

[19]  Ilkka Niemelä,et al.  Developing a Declarative Rule Language for Applications in Product Configuration , 1999, PADL.

[20]  autoepistemic Zogic Logic programming and negation : a survey , 2001 .

[21]  Ilkka Niemelä,et al.  Stable Model Semantics of Weight Constraint Rules , 1999, LPNMR.

[22]  Stefania Costantini,et al.  Contributions to the Stable Model Semantics of Logic Programs with Negation , 1993, Theor. Comput. Sci..

[23]  Michael Winikoff,et al.  Programming in Lygon: A Brief Overview , 1995, ILPS.

[24]  David Pearce,et al.  Strong Equivalence of RASP Programs , 2012, Correct Reasoning.

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

[26]  Georg Gottlob,et al.  Complexity and expressive power of logic programming , 2001, CSUR.

[27]  Andre Scedrov,et al.  A brief guide to linear logic , 1990, Bull. EATCS.

[28]  Agostino Dovier,et al.  An empirical study of constraint logic programming and answer set programming solutions of combinatorial problems , 2009, J. Exp. Theor. Artif. Intell..

[29]  Max I. Kanovich,et al.  The Complexity of Horn Fragments of Linear Logic , 1994, Ann. Pure Appl. Log..

[30]  Anil Nerode,et al.  Contributions to the Stable Model Semantics of Logic Programs with Negation , 1993 .

[31]  Andre Scedrov,et al.  Linear Logic and Computation: A Survey , 1995 .

[32]  Michael Gelfond,et al.  Classical negation in logic programs and disjunctive databases , 1991, New Generation Computing.

[33]  Vladimir Lifschitz,et al.  Twelve Definitions of a Stable Model , 2008, ICLP.

[34]  Chitta Baral,et al.  Knowledge Representation, Reasoning and Declarative Problem Solving , 2003 .

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