Efficient resource management for linear logic proof search

  • Iliano Cervesato
  • Joshua S. Hodas
  • Frank Pfenning
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1050)


The design of linear logic programming languages and theorem provers opens a number of new implementation challenges not present in more traditional logic languages such as Horn clauses (Prolog) and hereditary Harrop formulas (λProlog). Among these, the problem of efficiently managing the linear context when solving a goal is of crucial importance for the use of these systems in non-trivial applications. This paper studies this problem in the case of Lolli [6] (though its results have application to other systems). We first give a proof-theoretic presentation of the operational semantics of this language as a resolution calculus. We then present a series of resource management systems designed to eliminate the non-determinism in the distribution of linear formulas that undermines the efficiency of a direct implementation of this system.


Logic Program Logic Programming Proof System Linear Logic Context Management 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Jean-Marc Andreoli and Remo Pareschi. Linear Objects: Logical Processes with Built-in Inheritance. New Generation Computing 9:3–4, 1991.Google Scholar
  2. 2.
    Jean-Yves Girard. Linear logic. Theoretical Computer Science, 50:1–101, 1987.Google Scholar
  3. 3.
    James Harland and David Pym. The uniform proof-theoretic foundation of linear logic programming. In Proceedings of the International Logic Programming Symposium, San Diego, California, October 1991, V. Saraswat and K. Ueda, eds., pp. 304–318.Google Scholar
  4. 4.
    James Harland and Michael Winikoff. Deterministic resource management for the linear logic programming language Lygon. Technical Report TR 94/23, Melbourne University, Department of Computer Science, 1994.Google Scholar
  5. 5.
    Joshua S. Hodas, Logic Programming in Intuitionistic Linear Logic: Theory, Design, and Implementation, Ph.D. Dissertation from University of Pennsylvania, Department of Computer and Information Science, May 1994. Available electronically at∼hodas/papers/.Google Scholar
  6. 6.
    Joshua S. Hodas and Dale Miller. Logic Programming in a Fragment of Linear Logic. Journal of Information and Computation, 110(2):327–365, 1994.Google Scholar
  7. 7.
    Keehang Kwon. Towards a Verified Abstract Machine for a Logic Programming Language with a Notion of Scope. PhD thesis, Department of Computer Science, Duke University, December 1994. Available as Technical Report CS-1994-36.Google Scholar
  8. 8.
    Timothy G. Lindholm and Richard A. O'Keefe. Efficient Implementation of a Defensible Semantics for Dynamic Prolog Code. Proceedings of the Fourth International Conference on Logic Programming, J.L. Lassez, ed., pp 21–39, MIT Press 1987.Google Scholar
  9. 9.
    Dale Miller. A logic programming language with lambda-abstraction, function variables, and simple unification. In P. Schröder-Heister editor, Proceedings of the International Workshop on Proof-Theoretical Extensions of Logic Programming, pages 253–281, Tübingen, Germany, 1989, Springer-Verlag LNAI 475.Google Scholar
  10. 10.
    Dale Miller. A Multiple-Conclusion Meta-Logic. Proceedings of the 1994 Symposium on Logics in Computer Science, S. Abramsky, ed., pp. 272–281.Google Scholar
  11. 11.
    Dale Miller, Gopalan Nadathur, Frank Pfenning, and Andre Scedrov. Uniform proofs as a foundation for logic programming, Annals of Pure and Applíed Logic, 51:125–157, 1991.Google Scholar
  12. 12.
    Gopalan Nadathur, Bharat Jayaraman, and Keehang Kwon. Scoping constructs in logic programming: Implementation problems and their solution. Technical Report CS-1994-35, Department of Computer Science, Duke University, October 1994. To appear in Journal of Logic Programming.Google Scholar
  13. 13.
    Frank Pfenning. Elf: A meta-language for deductive systems. In A. Bundy, editor, Proceedings of the 12th International Conference on Automated Deduction, pages 811–815, Nancy, France, June 1994. Springer-Verlag LNAI 814. System abstract.Google Scholar

Copyright information

© Springer-Verlag 1996

Authors and Affiliations

  • Iliano Cervesato
    • 1
  • Joshua S. Hodas
    • 2
  • Frank Pfenning
    • 1
  1. 1.Department of Computer ScienceCarnegie Mellon UniversityPittsburghUSA
  2. 2.Computer Science DepartmentHarvey Mudd CollegeClaremontUSA

Personalised recommendations