Efficient resource management for linear logic proof search

Theoretical Computer Science

Volumn 232, Issue 1-2, 2000, Pages 133-163

  Cervesato, Iliano ^a   Hodas, Joshua S ^b   Pfenning, Frank ^c  

^a Stanford University   (United States)

^b HARVEY MUDD COLLEGE   (United States)

^c Carnegie Mellon University   (United States)

Author keywords

Linear logic; Logic programming; Theorem proving

Indexed keywords

EID: 0001306213     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(99)00173-5     Document Type: Article

References (27)

1. J.M. Andreoli, R. Pareschi, Linear objects: logical processes with built-in inheritance, New Generation Comput. 9 (1991) 445-473.
2. I. Cervesato, J.S. Hodas, D. Miller, F. Pfenning, Some implementations of the linear logic programming language Lolli, Available on the World Wide Web at address http://www.cs.cmu.edu/∼fp/lolli
3. I. Cervesato, J.S. Hodas, F. Pfenning, Efficient resource management for linear logic proof search, in: R. Dyckhoff, H. Herre, P. Schroeder-Heister (Eds.), Proceedings of the Fifth International Workshop on Extensions of Logic Programming - ELP'96, Leipzig, Germany, 28-30 March 1996, Springer, Berlin, LNAI 1050, pp. 67-81.
4. I. Cervesato, F. Pfenning, A linear logical framework, in: E. Clarke (Ed.), Proceedings of the Eleventh Annual Symposium on Logic in Computer Science - LICS'96, New Brunswick, NJ, 27-30 July 1996, pp. 264-275, IEEE Computer Society Press, Silver Spring, MD. This work also appeared as Preprint 1834 of the Department of Mathematics of Technical University of Darmstadt, Germany.
5. D. Galmiche, G. Perrier, Foundations of proof search strategies design in linear logic, in: Symposium on Logical Foundations of Computer Science, St. Petersburg, Russia, 1994, Lecture Notes in Computer Science, Springer, Berlin, pp. 101-113. Also available as Technical Report CRIN 94-R-112 from the Centre di Recherche en Informatique de Nancy.
6. J.-Y. Girard, Linear logic, Theoret. Comput. Sci. 50 (1987) 1-102.
7. J. Harland, D. Pym, The uniform proof-theoretic foundation of linear logic programming, in: V. Saraswat, K. Ueda (Eds.), Proceedings of the International Logic Programming Symposium, San Diego, CA, October 1991, pp. 304-318.
8. J. Harland, D. Pym, Resource-distribution via boolean constraints, in: W. McCune (Ed.), Proceedings of the Fourteenth International Conference on Automated Deduction - CADE-14, Townsville, Australia, July 1997, Lecture Notes in Artificial Intelligence, Vol. 1249, Springer, pp. 222-236.
9. J.S. Hodas, Logic programming in intuitionistic linear logic: theory, design and Implementation, Ph.D. Thesis, University of Pennsylvania, Department of Computer and Information Science, 1994.
10. J.S. Hodas, D. Miller, Logic programming in a fragment of intuitionistic linear logic, Inform. and Comput. 110(2) (1994) 327-365. Extended abstract in the Proceedings of the Sixth Annual Symposium on Logic in Computer Science, Amsterdam, July 15-18, 1991.
11. J.S. Hodas, D. Miller, Logic programming in a fragment of intuitionistic linear logic, Inform. and Comput. 110(2) (1994) 327-365. Extended abstract in the Proceedings of the Sixth Annual Symposium on Logic in Computer Science, Amsterdam, July 15-18, 1991.
12. J.S. Hodas, J. Polakow, Forum as a logic programming language: Preliminary results and observations, in: M. Okada (Ed.), Proceedings of the Linear Logic '96 Meeting, Tokyo, Japan, 1996, Electronic Notes in Theoretical Computer Science, Vol. 3, Elsevier; Amsterdam.
13. N. Kobayashi, A. Yonezawa, ACL - A concurrent linear logic programming paradigm, in: D. Miller (Ed.), Proceedings of the 1993 International Logic Programming Symposium, Vancouver, Canada, October 1993, MIT Press, Cambridge, MA, pp. 279-294.
14. K. Kwon, Towards a verified abstract machine for a logic programming language with a notion of scope, Ph.D Thesis, Department of Computer Science, Duke University, December 1994, available as Technical Report CS-1994-36.
15. T.G. Lindholm, R.A. O'Keefe, Efficient implementation of a defensible semantics for dynamic Prolog code, in: J.L. Lassez (Ed.), Proceedings of the Fourth International Conference on Logic Programming - ICLP'87, Melbourne, Australia, 1987, MIT Press, Cambridge, MA, pp. 21-39.
16. J. López, E. Pimentel, A lazy splitting system for Forum, in: M. Falaschi, M. Navarro, A. Policriti (Eds.), Proceedings of the Joint Conference on Declarative Programming - APPIA-GULP-PRODE'97, Grado, Italy, 1997, pp. 247-258.
17. D. Miller, A logic programming language with lambda-abstraction, function variables, and simple unification, J. Logic Comput. 1(4) (1991) 497-536.
18. D. Miller, A multiple-conclusion specification logic, Theoret. Comput. Sci. 165(1) (1996) 201-232.
19. D. Miller, G. Nadathur, F. Pfenning, A. Scedrov, Uniform proofs as a foundation for logic programming, Ann. Pure Appl. Logic 51 (1991) 125-157.
20. G. Mints, Resolution calculus for the first order linear logic, J. Logic, Language Inform. 2(1) 1993 59-83.
21. G. Nadathur, B. Jayaraman, K. Kwon, Scoping constructs in logic programming: Implementation problems and their solution, J. Logic Programm. 25(2) (1995) 119-161.
22. F. Pfenning, Computation and deduction, Cambridge University Press, in preparation.
23. F. Pfenning, Elf: A meta-language for deductive systems, in: A. Bundy (Ed.), Proceedings of the 12th International Conference on Automated Deduction, Nancy, France, June 1994, Springer, Berlin, Lecture Notes in Artificial Intelligence, vol. 814, System abstract, pp. 811-815.
24. D.J. Pym, A, Harland, A uniform proof-theoretic investigation of linear logic programming, J. Logic Comput. 4(2) (1994) 175-207.
25. T. Tammet, Proof strategies in linear logic, J. Automat. Reasoning 12 (1994) 273-304. Also available as Programming Methodology Group Report 70, Chalmers University, 1993.
26. T. Tammet, Proof strategies in linear logic, J. Automat. Reasoning 12 (1994) 273-304. Also available as Programming Methodology Group Report 70, Chalmers University, 1993.
27. M. Winikoff, J. Harland. Deterministic resource management for the linear logic programming language Lygon, Report TR 94/23, Melbourne University, Department of Computer Science, 1994.