Logic Programming with Focusing Proofs in Linear Logic

@article{Andreoli1992LogicPW,
  title={Logic Programming with Focusing Proofs in Linear Logic},
  author={Jean-Marc Andreoli},
  journal={J. Log. Comput.},
  year={1992},
  volume={2},
  pages={297-347}
}
  • J. Andreoli
  • Published 1 June 1992
  • Mathematics, Computer Science
  • J. Log. Comput.
The deep symmetry of linear logic [18] makes it suitable for providing abstract models of computation, free from implementation details which are, by nature, oriented and nonsymmetrical. I propose here one such model, in the area of logic programming, where the basic computational principle is Computation = Proof search Proofs considered here are those of the Gentzen style sequent calculus for linear logic. However, proofs in this system may be redundant, in that two proofs can be syntactically… 
Abstract Interpretation of Linear Logic Programming
TLDR
This paper proposes to push the compilation/normalization process further, by applying abstract interpretation and partial evaluation techniques to (focused) proofs in LinLog, and provides information concerning the evolution of the computational resources during the execution.
Proofs as computations in linear logic
TLDR
An extension of hereditary Harrop formulas and a corresponding logical system which are the foundations of the logic programming language are presented.
Static analysis of Linear Logic programming
TLDR
This paper proposes to push the compilation/normalization process further, by applying abstract interpretation and partial evaluation techniques to (focused) proofs inLinLog, by providing information concerning the evolution of the computational resources during the execution of proofs.
On the Specification of Sequent Systems
TLDR
This paper introduces Llinda, a logical framework based on linear logic augmented with inference rules for definition (fixed points) and induction, and extends the definition of coherence and provides a new, semi-automated proof of cut-elimination for Girard’s Logic of Unicity (LU).
Focused Proof Search for Linear Logic in the Calculus of Structures
TLDR
This work in progress aims at translating the notion of focusing into the presentation of linear logic in this setting, and use some of its specific features, such as deep application of rules and fine granularity, in order to improve proof search procedures.
Semantics of Concurrent Logic Programming as Uniform Proofs
TLDR
The LC fragment is proved to be an abstract logic programming language that is any sequent can be derived by uniform proofs, and can be viewed in terms of multiset rewriting and is reminiscent of the computations arising in the Chemical Abstract Machine and in the Gamma model.
On structuring proof search for first order linear logic
TLDR
G-Forum consists of two (big) inference rules, for which a cut elimination procedure does not need to appeal to finer detail in formulae and sequents than is provided by Forum, thus successfully testing the internal symmetries of the system.
Fucusing and Proof-Nets in Linear and Non-commutative Logic
TLDR
It is shown here that Focusing can also be interpreted in the proof-net formalism, where it appecirs, at least in the multiplicative fragment, to be a simple refinement of the "Splitting lemma" for proof-nets.
Sequent Calculus and the Specification of Computation Lecture Notes
The sequent calculus has been used for many purposes in recent years within theoretical computer science. In these lectures, we shall highlight some of its uses in the specification of and reasoning
From Proofs to Focused Proofs: A Modular Proof of Focalization in Linear Logic
TLDR
A new proof of the completeness of focused proofs in terms of proof transformation is given, first proved for MALL and then extended to full linear logic, and it is shown how the proof can be extended to larger systems, such as logics with induction.
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 32 REFERENCES
Uniform Proofs as a Foundation for Logic Programming
TLDR
A proof-theoretic characterization of logical languages that form suitable bases for Prolog-like programming languages is provided and it is shown that first-order and higher-order Horn clauses with classical provability are examples of such a language.
Logic Programming with Sequent Systems, A Linear Logic Approach
TLDR
It is shown here that the sequent system of propositional Classical Logic already contains the necessary tools for the purpose of this extension of Prolog, especially the cut rule together with a Cut normalisation theorem.
Logic programming in a fragment of intuitionistic linear logic
  • J. S. Hodas, Dale Miller
  • Mathematics, Computer Science
    [1991] Proceedings Sixth Annual IEEE Symposium on Logic in Computer Science
  • 1991
The intuitionistic notion of context is refined by using a fragment of J.-Y. Girard's (Theor. Comput. Sci., vol.50, p.1-102, 1987) linear logic that includes additive and multiplicative conjunction,
Computational Interpretations of Linear Logic
  • S. Abramsky
  • Mathematics, Computer Science
    Theor. Comput. Sci.
  • 1993
TLDR
Girard's linear logic is studied from the point of view of giving a concrete computational interpretation of the logic, based on the Curry—Howard isomorphism, which opens up a promising new approach to the parallel implementation of functional programming languages.
PARLOG: parallel programming in logic
TLDR
A tutorial introduction to PARLOG, a logic programming language in the sense that nearly every definition and query can be read as a sentence of predicate logic, which differs from PROLOG in incorporating parallel modes of evaluation.
The family of concurrent logic programming languages
TLDR
The expressive power of even the simplest language in the family of concurrent logic programming languages within a uniform operational framework is demonstrated and how varying the basic synchronization and control constructs affect the expressiveness and efficiency of the resulting languages is investigated.
Interaction nets
TLDR
A new kind of programming language, with the following features: a simple graph rewriting semantics, a complete symmetry between constructors and destructors, and a type discipline for deterministic and deadlock-free (microscopic) parallelism.
From Petri Nets to Linear Logic
TLDR
A systematic correspondence between Petri nets, linear logic theories, and linear categories is established, which sheds new light on the relationships between linear logic and concurrency, and on how both areas are related to category theory.
Linear logic
TLDR
This column presents an intuitive overview of linear logic, some recent theoretical results, and summarizes several applications oflinear logic to computer science.
A parallel machine for multiset transformation and its programming style
TLDR
This work advocates the separation of the design of programs for massively parallel machines into two steps which can be verified in a formal way: the construction of a program with implicit parallelism (Γ-program) and its translation into a network of processes.
...
1
2
3
4
...