A logical characterization of forward and backward chaining in the inverse method

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

Volumn 4130 LNAI, Issue , 2006, Pages 97-111

  Chaudhuri, Kaustuv ^a   Pfenning, Frank ^a   Price, Greg ^a  

^a Carnegie Mellon University ^*  (United States)

Author keywords

[No Author keywords available]

Indexed keywords

FORMAL LOGIC; PROBLEM SOLVING;

BACKWARD CHAINING; HORN FRAGMENT; LINEAR LOGIC;

INVERSE PROBLEMS;

EID: 33749559663     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11814771_9     Document Type: Conference Paper

References (18)

1. Jean-Marc Andreoli. Logic programming with focusing proofs in linear logic. Journal of Logic and Computation, 2(3):297-347, 1992.
2. Jean-Marc Andreoli. Focussing and proof construction. Annals of Pure and Applied Logic, 107:131-163, 2001.
3. Iliano Cervesato, Frank Pfenning, David Walker, and Kevin Watkins. 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.
4. Kuustuv Chaudhuri and Frank Pfenning. A focusing inverse method theorem prover for firstorder linear logic. In Proceedings of CADE-20, pages 69-83, Tallinn, Estonia, July 2005. Springer-Verlag LNAI-3632.
5. Kaustuv Chaudhuri and Frank Pfenning. Focusing the inverse method for linear logic. In Luke Ong, editor, Proceedings of CSL 2005, pages 200-215, Oxford, UK, August 2005. Springer-Verlag LNCS-3634.
6. Anatoli Degtyarev and Andrei Voronkov. The inverse method. In James Alan Robinson and Andrei Voronkov, editors, Handbook of Automated Reasoning, pages 179-272. MIT Press, September 2001.
7. Gerhard Gentzen. Untersuchungen über das logische Schließen. Mathematische Zeitschrift, 39:176-210, 405-431, 1935.
8. English translation in M. E. Szabo, editor, The Collected Papers of Gerhard Gentzen, pages 68-131, North-Holland, 1969.
9. Jean-Yves Girard. Locus solum: from the rules of logic to the logic of rules. Mathematical Structures in Computer Science, 11:301-506, 2001.
10. Joshua S. Hodas and Dale Miller. Logic programming in a fragment of intuitionistic linear logic. Information and Computation, 110(2):327-365, 1994.
11. Jacob M. Howe. Proof Search Issues in Some Non-Classical Logics. PhD thesis, University of St. Andrews, September 1998.
12. R. Kowalski and D. Kuehner. Linear resolution with selection function. Artificial Intelligence, 2:221-260, 1971.
13. Patrick Lincoln, J. C. Mitchell, Andre Scedrov, and Natarajan Shankar. Decision problems for prepositional linear logic. Annals of Pure and Applied Logic, 56:239-311, 1992.
14. Heiko Mantel and Jens Otten. LinTAP: A tableau prover for linear logic. In A. Murray, editor, International Conference TABLEAUX'99, pages 217-231, New York, June 1999. Springer-Verlag LNAI 1617.
15. D. Miller. A multiple-conclusion meta-logic. In S. Abramsky, editor, Ninth Annual Symposium on Logic in Computer Science, pages 272-281, Paris, France, July 1994. IEEE Computer Society Press.
16. Dan Sahlin, Torkel Franzén, and Seif Haridi. An intuitionistic predicate logic theorem prover. Journal of Logic and Computation, 2(5):619-656, 1992.
17. Tanel Tammet. Resolution, inverse method and the sequent calculus. In Proceedings of KCC'97, pages 65-83. Springer-Verlag LNCS 1289, 1997.
18. Naoyuki Tamura. Llprover. At: http://bach.istc.kobe-u.ac.jp/llprover.