Foundations of proof search strategies design in linear logic

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 813 LNCS, Issue , 1994, Pages 101-113

  Galmiche, D ^a   Perrier, G ^a  

^a INRIA   (France)

Author keywords

[No Author keywords available]

Indexed keywords

FOUNDATIONS; LINEAR ALGEBRA;

AUTOMATED PROOFS; BOTTOM UP; CLASSICAL LINEAR LOGIC; LINEAR LOGIC; LOGICAL FOUNDATIONS; PROOF SEARCH; PROOF STRATEGY; THEORETICAL FOUNDATIONS;

COMPUTER CIRCUITS;

EID: 21344497464     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-58140-5_11     Document Type: Conference Paper

References (15)

1. S. Abramsky. Computational interpretations of linear logic. Theoretical Computer Science, 111(1-2):3-58, 1993.
2. J.M. Andreoli. Logic programming with focusing proofs in linear logic. Journal of Logic and Computation, 2(3):297-347, 1992.
3. G. Bellin. Proof nets for multiplicative and additive linear logic. Technical Report ECS-LFCS 91-161, Department of Computer Science, Edinburgh University, May 1991.
4. J. Chirimar and J. Lipton. Provability in TBLL: a decision procedure. In CSL ‘91, LNCS 626, pages 53-65, Bern, October 1991.
5. D. Galmiche and G. Perrier. Automated deduction in additive and multiplicative linear logic. In Logic at Tver ‘92, Logical Foundations of Computer Science Symposium, LNCS 620, pages 151-162, Tver, Russia, July 1992.
6. D. Galmiche and G. Pettier. On proof normalisation in linear logic. Research report 93-R-059, CRIN-CNRS, 1992. To be published in Theoretical Computer Science.
7. J.Y. Girard. Linear logic. Theoretical Computer Science, 50(1):1-102, 1987.
8. J. Harland and D. Pym. On resolution in fragments of classical linear logic. In LPAR’92, International Conference on Logic Programming and Automated Reasoning, LNAI 624, pages 30-41, St. Petersburg, Russia, July 1992.
9. J.S. Hodas and D. Miller. Logic programming in a fragment of intuitionistic linear logic. In 6th 1EEE Symposium on Logic in Computer Science, pages 32-42, Amsterdam, The Netherlands, July 1991.
10. N. Kobayashi and A. Yonezawa. ACL - a concurrent linear logic programming paradigm. In Int. Symposium on Logic Programming, pages 279-294, Vancouver, October 1993.
11. P. Lincoln, J. Mitchell, A. Scedrov, and N. Shankar. Decision problems for propositional linear logic. Annals of Pure and Applied Logic, 56:239-311, 1992.
12. J. Meseguer and N. Marti-Oliet. From Petri nets to linear logic, In Category Theory and Computer Science, LNCS 389, pages 313-340, Manchester, September 1989.
13. N. Shankar. Proof search in the intuitionistic sequent calculus. In 11th Conference on Automated DEduction, LNAI 607, pages 522-536, Saratoga Springs, June 1992.
14. T. Tammet. Proof search strategies in linear logic. Programming Methodology Group Report 70, Chalmers University Group, University of Göteborg, 1993.
15. L.A. Wallen. Automated Proof search in Non-Classical Logics. MIT Press, 1990.