linTAP: A tableau prover for linear logic

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

Volumn 1617, Issue , 1999, Pages 217-231

  Mantel, Heiko ^a   Otten, Jens ^b  

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

^b DARMSTADT UNIVERSITY OF TECHNOLOGY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

CALCULATIONS; LINEAR ALGEBRA; RECONFIGURABLE HARDWARE;

LINEAR LOGIC;

COMPUTER CIRCUITS;

EID: 84957360366     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-48754-9_20     Document Type: Conference Paper

References (25)

1. J.-M. Andreoli. Logic programming with focusing proofs in linear logic. Journal of Logic and Computation, 2(3):297–347, 1992.
2. B. Beckert, J. Posegga. leanTAP: Lean Tableau-Based Theorem Proving. 12th Conference on Automated Deduction, LNAI 814, pp. 793–797. Springer, 1994.
3. B. Beckert, J. Posegga. leanTAP: Lean Tableau-Based Deduction. Journal of Automated Reasoning, 15 (3), pp. 339–358, 1995.
4. B. Beckert, R. Goré. Free Variable Tableaux for Propositional Modal Logics. Proc. 6th TABLEAUX Conference, LNAI 1227, pp. 91–106, Springer 1997.
5. W. Bibel. Let’s plan it deductively!. In IJCAI-97, Morgan Kaufmann, 1997. 230
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. M. Fitting. First-Order Logic and Automated Theorem Proving. Springer, 1996. 223
8. B. Fronhöfer. The action-as-implication paradigm. CS Press, 1996. 217
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. 217
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. J. Harland and D. Pym. Resource-Distribution via Boolean Constraints. 14th 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. C. Kreitz, H. Mantel, J. Otten, S. Schmitt. Connection-Based Proof Construction in Linear Logic. 14th 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, C. Kreitz. A Matrix Characterization for MELL. Logics in Artificial Intelligence, JELIA’98, LNAI 1489, pp. 169–183, Springer, 1998.
18. A. Martelli and U. Montanari. An efficient unification algorithm. ACM TOPLAS, 4:258–282, 1982.
19. M. Masseron, C. Tollu, J. Vauzeilles. Generating plans in linear logic. In Foundations of Software Technology and Theoretical Computer Science, LNCS, Springer, 1991. 217
20. D. Miller. FORUM: A Multiple-Conclusion Specification Logic. TCS, 165(1):201-232, 1996.
21. J. Otten. ileanTAP: An Intuitionistic Theorem Prover. Proc. 6th TABLEAUX Conference, LNAI 1227, pp. 307–312, Springer 1997.
22. J. Otten, C. Kreitz. T-String-Unification: Unifying Prefixes in Non-Classical Proof Methods. Proc. 5th TABLEAUX Workshop, LNAI 1071, pp. 244–260, 1996.
23. T. Tammet. Proof strategies in linear logic. JAR, 12:273–304, 1994.
24. N. Tamura. User’s Guide of a Linear Logic Theorem Prover (llprover). Technical report. Faculty of Engineering, Kobe University, Japan, 1995. 230, 230, 230
25. L. Wallen. Automated deduction in nonclassical logic. MIT Press, 1990. 217