Coalgebraic Derivations in Logic Programming

Coalgebra may be used to provide semantics for SLD-derivations, both finite and infinite. We first give such semantics to classical SLD-derivations, proving results such as adequacy, soundness and completeness. Then, based upon coalgebraic semantics, we propose a new sound and complete algorithm for parallel derivations. We analyse this new algorithm in terms of the Theory of Observables, and we prove correctness and full abstraction results.

[1]  Gopalan Nadathur,et al.  Higher-Order Logic Programming , 1986, ICLP.

[2]  Gopal Gupta,et al.  Co-Logic Programming: Extending Logic Programming with Coinduction , 2007, ICALP.

[3]  Jean-Yves Girard,et al.  Linear Logic , 1987, Theor. Comput. Sci..

[4]  Gopal Gupta,et al.  Optimal implementation of and-or parallel Prolog , 1994, Future Gener. Comput. Syst..

[5]  Maurizio Gabbrielli,et al.  Observable Behaviors and Equivalences of Logic Programs , 1995, Inf. Comput..

[6]  Giorgio Levi,et al.  A Theory of Observables for Logic Programs , 2001, Inf. Comput..

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

[8]  David J. Pym,et al.  The semantics and proof theory of the logic of bunched implications , 2002, Applied logic series.

[9]  Mathieu Jaume,et al.  On Greatest Fixpoint Semantics of Logic Programming , 2002, J. Log. Comput..

[10]  Lawrence C. Paulson,et al.  Logic Programming, Functional Programming, and Inductive Definitions , 1991, ELP.

[11]  Andrea Asperti,et al.  Projections Instead of Variables: A Category Theoretic Interpretation of Logic Programs , 1989, ICLP.

[12]  Gianluca Amato,et al.  On the algebraic structure of declarative programming languages , 2009, Theor. Comput. Sci..

[13]  Rong Yang,et al.  Andorra I: a parallel Prolog system that transparently exploits both And-and or-parallelism , 1991, PPOPP '91.

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

[15]  Ekaterina Komendantskaya,et al.  Fibrational Semantics for Many-Valued Logic Programs: Grounds for Non-Groundness , 2008, JELIA.

[16]  Guy McCusker,et al.  Coalgebraic Semantics for Logic Programming , 2010 .

[17]  Ugo Montanari,et al.  Reactive systems, (semi-)saturated semantics and coalgebras on presheaves , 2009, Theor. Comput. Sci..

[18]  Ekaterina Komendantskaya,et al.  Coalgebraic Semantics for Derivations in Logic Programming , 2011, CALCO.

[19]  Roberto Bruni,et al.  An interactive semantics of logic programming , 2001, Theory and Practice of Logic Programming.

[20]  John Power,et al.  A Fibrational Semantics for Logic Programs , 1996, ELP.

[21]  Gopal Gupta,et al.  Coinductive Logic Programming and Its Applications , 2007, ICLP.

[22]  Paris C. Kanellakis,et al.  Logic Programming and Parallel Complexity , 1986, Foundations of Deductive Databases and Logic Programming..

[23]  Davide Ancona,et al.  Type Inference by Coinductive Logic Programming , 2008, TYPES.

[24]  Guy McCusker,et al.  Coalgebraic Semantics for Parallel Derivation Strategies in Logic Programming , 2010, AMAST.

[25]  Enrico Pontelli,et al.  On the Duality Between Or-parallelism and And-parallelism in Logic Programming , 1995, Euro-Par.

[26]  John C. Mitchell,et al.  On the Sequential Nature of Unification , 1984, J. Log. Program..

[27]  Jeffrey D. Ullman,et al.  Parallel complexity of logical query programs , 1986, 27th Annual Symposium on Foundations of Computer Science (sfcs 1986).