Connection-based proof construction in linear logic

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

Volumn 1249, Issue , 1997, Pages 207-221

  Kreitz, C ^a   Mantel, H ^b   Otten, J ^c   Schmitt, S ^c  

^a Department of Computer Science and School of Operations Research and Information Engineering   (United States)

^b GERMAN RESEARCH CENTER FOR ARTIFICIAL INTELLIGENCE DFKI   (Germany)

^c DARMSTADT UNIVERSITY OF TECHNOLOGY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATION; CALCULATIONS; DIFFERENTIATION (CALCULUS); MATRIX ALGEBRA; THEOREM PROVING;

LINEAR LOGIC; MATRIX CHARACTERIZATIONS; MODAL LOGIC; MULTIPLICATIVE FRAGMENT; PROOF SEARCH; SEQUENT CALCULUS;

COMPUTER CIRCUITS;

EID: 84957062156     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-63104-6_20     Document Type: Conference Paper

References (27)

1. J.-M. Andreoli. Logic programming with focussing proofs in linear logic. Journal of Logic and Computation, 2(3):297-347, 1993.
2. W. Bibel. On matrices with connections. Journal of the ACM, 28:633-645, 1981.
3. W. Bibel. A deductive solution for plan generation. New Generation Computing, 4:115-132, 1986.
4. W. Bibel. Automated theorem proving. Vieweg, 1987.
5. I. Cervesato, J.S. Hodas, F. Pfenning Efficient resource management for linear logic proof search. Extensions of Logic Programming, LNAI 1050, pp. 67-81, 1996.
6. V. Danos, L. Regnier The structure of the multiplicatives. Archive for Mathematical Logic, 28:181-203, 1989.
7. B. Fronhôfer The action-as-implication paradigm, CS Press, 1996.
8. D. Galmiche Connection methods in linear logic fragments and proof nets construction. CADE-13 workshop on proof search in type-theoretic languages, 1996.
9. D. Galmiche, G. Perrier. A procedure for automatic proof nets construction. LPAR'92, LNAI 624, pp. 42-53, Springer Verlag, 1992.
10. D. Galmiche, G. Perrier. On proof normalization in linear logic. TCS, 135:67-110, 1994.
11. V. Gehlot, C. Gunter. Normal process representatives. In Proc. 5-th Annual IEEE Symposium on Logic in Computer Science, pp. 200-207, 1991.
12. J.-Y. Girard. Linear logic. Theoretical Computer Science, 50:1-102, 1987.
13. J.-Y. Girard. Proof-nets: the parallel syntax for proof-theory. In Logic and Algebra, LNPAM 150, pp. 97-124, 1996.
14. J.S. Hodas, D. Miller. Logic programming in a fragment of linear logic. Journal of Information and Computation, 110(2):327-365, 1994.
15. H. Mantel. Eine Matrixcharakterisierung für ein Fragment der linearen Logik. Diplomarbeit, TH-Darmstadt, Germany, 1996.
16. A.Martelli, U.Montanari. An efficient unification algorithm. ACM TOPLAS, 4:258-282, 1982.
17. M. Masseron, C. Tollu, J. Vauzielìes Generating plans in linar logic. In Foundations of Software Technology and Theoretical Computer Science, LNCS 472, pp. 63-75, Springer, 1990.
18. J. McCarthy, P.H. Hayes Some philosophical problems from the standpoint of Artificial Intelligence Machine Intelligence,4:463-502, 1969.
19. J. Otten, C. Kreitz. A connection based proof method for intuitionistic logic. 4TABLEAUX Workshop, LNAI 918, pp. 122-137, Springer Verlag, 1995.
20. J. Otten, C. Kreitz. T-string-unification: unifying prefixes in non-classical proof methods. TABLEAUX Workshop, LNAI 1071, pp. 244-260, Springer Verlag, 1996.
21. J. Otten, C. Kreitz. A uniform proof procedure for classical and non-classical logics. KI-96: Advances in Artificial Intelligence, LNAI 1137, pp. 307-319, Springer Verlag, 1996.
22. J. Otten. ileanTAP: An intuitionistic theorem prover. International Conference TABLEAUX>97, LNAI, Springer Verlag, 1997.
23. S. Schmitt, C. Kreitz. On transforming intuitionistic matrix proofs into standard-sequent proofs. 4*** TABLEAUX Workshop, LNAI 918, pp. 106-121, Springer Verlag, 1995.
24. S. Schmitt, C. Kreitz. Converting non-classical matrix proofs into sequent-style systems. CADE-13, LNAI 1104, pp. 418-432, Springer Verlag, 1996.
25. S. Schmitt, C. Kreitz. A uniform procedure for converting non-classical matrix proofs into sequent-style systems. Journal of Information and Computation, submitted.
26. T. Tammet. Proof strategies in linear logic. Jour, of Automated Reasoning, 12:273-304, 1994.
27. L. Wallen. Automated deduction in non-classical logics. MIT Press, 1990.