A matrix characterization for MɛLL

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

Volumn 1489, Issue , 1998, Pages 169-184

  Mantel, Heiko ^a   Kreitz, Christoph ^b  

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

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

Author keywords

[No Author keywords available]

Indexed keywords

CALCULATIONS; DIFFERENTIATION (CALCULUS);

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

ARTIFICIAL INTELLIGENCE;

EID: 84949939606     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-49545-2_12     Document Type: Conference Paper

References (24)

1. J.-M. Andreoli. Logic programming with focusing proofs in linear logic. Journal of Logic and Computation, 2(3):297-347, 1992.
2. P. ANDREWS. Theorem-Proving via General Matings. Jour. of the ACM 28 (2), 193-214, 1981.
3. W. Bibel. On matrices with connections. Jour. of the ACM 28, 633-645, 1981.
4. W.Bibel. A deductive solution for plan generation. New Generation Computing 4:115-132,1986.
5. W. Bibel. Automated Theorem Proving. Vieweg, 1987.
6. I. Cervesato, J.S. Hodas, F. Pfenning. Efficient resource management for linear logic proof search. In Extensions of Logic Programming, LNAI 1050, pages 67-81. Springer, 1996.
7. V. Danos & L. Regnier. The structure of the multiplicatives. Arch. Math. Logic 28:181-203, 1989.
8. B. Fronhofer. The action-as-implication paradigm. CS Press, 1996.
9. D. Galmiche. Connection methods in linear logic fragments and proof nets. Technical report, CADE-13 workshop on proof search in type-theoretic languages, 1996.
10. D. Galmiche & G. Perrier. On proof normalization in linear logic. TCS, 135:67-110, 1994.
11. V. Gehlot and C. Gunter. Normal process representatives. Sixth Annual Symposium on Logic in Computer Science, pages 200-207, 1991.
12. J.-Y. Girard. Linear logic. TCS, 50:1-102, 1987.
13. th Conference on Automated Deduction, LNCS 1249, pp. 222-236. Springer, 1997.
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. th Conference on Automated Deduction, LNCS 1249, pp. 207-221. Springer, 1997.
16. P. Lincoln and T. Winkler. Constant-only multiplicative linear logic is NP-complete. TCS, 135:155-169, 1994.
17. H. Mantel. Developing a Matrix Characterization for MɛLL. Technical Report, DFKI SaarbrUcken, 1998. http://www.dfki.de/vse/staff/mantel/Papers/98tr-dev-mc-mell.ps.gz
18. M. Masseron, C. Tollu, J. Vauzeilles. Generating plans in linear logic. In Foundations of Software Technology and Theoretical Computer Science, LNCS, Springer,1991.
19. D. Miller. FORUM: A Multiple-Conclusion Specification Logic. TCS, 165(1):201-232, 1996.
20. 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, 1996.
21. S. SCHMITT, C. KREITZ. Converting non-classical matrix proofs into sequent-style systems. CADE-13, LNAI 1104, pp. 418-432, Springer, 1996.
22. S. SCHMITT, C. KREITZ. A uniform procedure for converting non-classical matrix proofs into sequent-style systems. Journal of Information and Computation, submitted.
23. T. Tammet. Proof strategies in linear logic. Jour. of Automated Reasoning, 12:273-304, 1994.
24. L. Wallen. Automated deduction in nonclassical logic. MIT Press, 1990.