The CoRe calculus

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

Volumn 3632 LNAI, Issue , 2005, Pages 84-98

  Autexier, Serge ^a  

^a SAARLAND UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

LOGIC PROGRAMMING; NATURAL LANGUAGE PROCESSING SYSTEMS; THEOREM PROVING;

NATURAL LANGUAGE; PARAMODULATION;

FORMAL LOGIC;

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

References (18)

1. J.-M. Andreoli. Focusing and proof construction. Annals of Pure and Applied Logic, 107(1):131-163, 2000.
2. P. B. Andrews. General models, descriptions, and choice in type theory. The Journal of Symbolic Logic, 37(2):385-397, June 1972.
3. S. Autexier. Hierarchical Contextual Reasoning. PhD thesis, Computer Science Department, Saarland University, Saarbrücken, Germany, 2003.
4. H.Barendregt. The X-Calculus - Its Syntax and Semantics. North Holland, 1984.
5. C. Benzmüller, C. E. Brown, and M. Kohlhase, Semantic Techniques for HigherOrder Cut-Elimination. SEKI Tech. Report SR-2004-07, Saarland University, 2004.
6. K. Brünnler. Deep Inference and Symmetry in Classical Proofs. Logos, 2004.
7. A. Bundy. The use of explicit plans to guide inductive proofs. DAI Research Report 349, Department of Artificial Intelligence, University of Edinburgh, 1987.
8. G. Dowek, Th. Hardin, and C. Kirchner. Theorem proving modulo. Rapport de Recherche 3400, INRIA, April 1998.
9. M. Fitting. Tableau methods of proof for modal logics. Notre Dame Journal of Formal Logic, XIII:237-247, 1972.
10. H. Ganzinger and J. Stuber. Superposition with equivalence reasoning and delayed clause normal form transformation. In F. Baader, editor, Automated Deduction CADE-19, volume 2741 of LNCS, pages 335-349. Springer-Verlag, 2003.
11. M. J. Gordon, A. J. Milner, and C. P. Wadsworth. Edinburgh LCF - A mechanised logic of computation. Springer Verlag, 1979. LNCS 78.
12. L. Herikin. Completeness in the theory of types. The Journal of Symbolic Logic, 15:81-91, 1950.
13. X. Huang. Human Oriented Proof Presentation: A Reconstructive Approach. Number 112 in DISKI. Infix, Sankt Augustin, Germany, 1996.
14. N. V. Murray and E. Rosenthal. Inference with path resolution and semantic: graphs. Journal of the Association of Computing Machinery, 34(2):225-254, 1987.
15. F. Pfenning. Proof Transformation in Higher-Order Logic. Phd thesis, Carnegie Mellon University, 1987.
16. K. Schütte. Proof Theory. (Onginaltitel: Beweistheorie), volume 255 of Die Grundlehren der mathematischen Wissenschaften. Springer, 1977.
17. R. M. Smullyan. First-Order Logic, volume 43 of Ergebnisse der Mathematik. Springer-Verlag, Berlin, 1968.
18. L. Wallen. Automated proof search in non-classical logics: efficient matrix proof methods for modal and, intuitionistic logics. MIT Press series in AI, 1990.