DCTP - A disconnection calculus theorem prover - System abstract

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

Volumn 2083 LNAI, Issue , 2001, Pages 381-385

  Letz, Reinhold ^a   Stenz, Gernot ^a  

^a TECHNICAL UNIVERSITY OF MUNICH   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

CALCULATIONS; COMPUTATION THEORY; SEMANTICS;

EXPERIMENTAL EVALUATION; FREE VARIABLE; FREE-VARIABLE TABLEAUX; MODEL GENERATION; NON-RIGID; TABLEAU METHOD; THEOREM PROVERS;

THEOREM PROVING;

EID: 84867829654     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45744-5_30     Document Type: Conference Paper

References (7)

1. P. Baumgartner, N. Eisinger, and U. Furbach. A confluent connection calculus. In Proceedings, CADE-16, Trento, LNAI 1632, pp. 329-343. Springer, 1999.
2. P. Baumgartner, U. Furbach, and I. Niemelä. Hyper tableaux. In Proceedings, JELIA-96, LNAI 1126, pp. 1-17, Springer, 1996.
3. Jean-Paul Billon. The disconnection method: a confluent integration of unification in the analytic framework. In Proceedings of the 5th TABLEAUX, Terrasini, LNAI 1071, pp. 110-126, Springer, 1996.
4. S.-J. Lee and D. Plaisted. Eliminating duplication with the hyper-linking strategy. Journal of Automated Reasoning, pp. 25-42, 1992.
5. Reinhold Letz, Klaus Mayr, and C. Goller. Controlled integration of the cut rule into connection tableau calculi. Journal of Automated Reasoning, 13(3):297-338, December 1994.
6. Reinhold Letz, Johann Schumann, Stephan Bayerl, and Wolfgang Bibel. SETHEO: A high-performance theorem prover. Journal of Automated Reasoning, 8(2):183-212, 1992.
7. Stephan Schulz. System Abstract: E 0.61. In Proc. of the 1st IJCAR, Siena, LNAI. Springer, 2001.