A focusing inverse method theorem prover for first-order linear logic

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

Volumn 3632 LNAI, Issue , 2005, Pages 69-83

  Chaudhuri, Kaustuv ^a   Pfenning, Frank ^a  

^a CARNEGIE MELLON UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; INVERSE PROBLEMS; LOGIC PROGRAMMING;

FIRST-ORDER LINEAR LOGIC; LINEAR CONNECTIVES; RESOURCE MANAGEMENT;

THEOREM PROVING;

EID: 26944467957     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11532231_6     Document Type: Conference Paper

References (22)

1. Girard, J.Y.: Linear logic. Theoretical Computer Science 50 (1987) 1-102
2. Andreoli, J.M.: Logic programming with focusing proofs in linear logic. Journal of Logic and Computation 2 (1992) 297-347
3. Galmiche, D., Perrier, G.: Foundations of proof search strategies design in linear logic. In: Symposium on Logical Foundations of Computer Science, St. Petersburg, Russia, SpringerVerlag LNCS 813 (1994) 101-113
4. Galmiche, D.: Connection methods in linear logic and proof nets constructions. Theoretical Computer Science 232 (2000) 213-272
5. Harland, J., Pym, D.J.: Resource-distribution via boolean constraints. In McCune, W., ed.: Proceedings of CADE-14, Springer-Verlag LNAI 1249 (1997) 222-236
6. Cervesato, I., Hodas, J.S., Pfenning, F: Efficient resource management for linear logic proof search. Theoretical Computer Science 232 (2000) 133-163
7. Pym, D.J., Harland, J.A.: The uniform proof-theoretic foundation of linear logic programming. Journal of Logic and Computation 4 (1994) 175-207
8. Hodas, J.S., Miller, D.: Logic programming in a fragment of intuitioni.stic linear logic. Information and Computation 110 (1994) 327-365
9. Mints, G.: Resolution calculus for the first order linear logic. Journal of Logic, Language and Information 2 (1993) 59-83
10. Tammet, T: Proof strategies in linear logic. Journal of Automated Reasoning 12 (1994) 273-304
11. Cervesato, I., Pfenning, F., Walker, D., Watkins, K.: A concurrent logical framework I & II. Technical Report CMU-CS-02-101 and 102, Department of Computer Science, Carnegie Mellon University (2002) Revised May 2003.
12. Chaudhuri, K., Pfenning, F.: Focusing the inverse method for linear logic. In: Proceedings of the 14th Annual Conference on Computer Science Logic (CSL'05). (2005) To appear; an extended version available as Technical Report CMU-CS-05-106, Department of Computer Science, Carnegie Mellon University (2005).
13. Méry, D.: Preuves et Sémantiques dans des Logiques de Ressources. PhD thesis, Université Henri Poincaré, Nancy, France (2004)
14. Donnelly, K., Gibson, T., Krishnaswami, N., Magill, S., Park, S.: The inverse method for the logic of bunched implications. In Baader, F., Voronkov, A., eds.: Proceedings of the 11th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning, Montevideo, Uruguay, Springer LNCS 3452 (2005) 466-480
15. Chang, B.Y.E., Chaudhuri, K., Pfenning, F: A judgmental analysis of linear logic. Technical Report CMU-CS-03-131R, Carnegie Mellon University (2003)
16. Degtyarev, A., Voronkov, A.: The inverse method. In Robinson, J.A., Voronkov, A., cds.: Handbook of Automated Reasoning. MIT Press (2001) 179-272
17. Tammet, T: Towards efficient subsumption. In: Proceedings of CADE-15. (1998) 427-441
18. Graf, R: Term Indexing. Springer LNAI 1053 (1996)
19. Andreoli, J.M.: Focussing and proof construction. Annals of Pure and Applied Logic 107 (2001)131-163
20. Mantel, H., Otten, J.: LinTAP: A tableau prover for linear logic. In Murray, A., ed.: International Conference TABLEAUX'99, New York, Springer-Verlag LNAI 1617 (1999) 217-231
21. Tamura, N.: Llprover (2005 (last checked)) At: http://bach.istc.kobe-u. ac.jp/ llprover.
22. Lincoln, P., Mitchcll, J.C., Scedrov, A., Shankar, N.: Decision problems for propositional linear logic. Annals of Pure and Applied Logic 56 ( 1992) 239-311