The disconnection method a confluent integration of unification in the analytic framework

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

Volumn 1071, Issue , 1996, Pages 110-126

  Billon, Jean Paul ^a  

^a Bull Corporate Research Center   (France)

Author keywords

[No Author keywords available]

Indexed keywords

BIOMINERALIZATION; CALCULATIONS; FORMAL LOGIC; INTEGRATION; ITERATIVE METHODS; PATHOLOGY; SEMANTICS;

CONTROL STRATEGIES; FIRST-ORDER LOGIC WITH EQUALITY; FREE VARIABLE; FULLY AUTOMATED; ITERATIVE DEEPENING; SEMANTIC TABLEAU; TEST PROBLEM; THEOREM PROVERS;

THEOREM PROVING;

EID: 84958950846     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-61208-4_8     Document Type: Conference Paper

References (15)

1. G. D. Alexander and D. A. Plaisted. Proving equality theorems with hyper-linking. In D. Kaput, editor, CADE-11 Proceedings, pages 706-710. Springer, 1992.
2. B. Becket and J. Posegga. Leantap: Lean tableau-based deduction. JAR, 15:339-358, 1995.
3. W. Bibel. Automated Theorem Proving. Vieweg Verlag, second edition, 1987.
4. W. Bibel. Issues in theorem proving based on the connection method. In P. Banmgartner, R. Hähnle, and J. Posegga, editors, 4th International Workshop, TABLEAUX '95 Proceedings, pages 1-16. Springer, 1995.
5. J.-P. Billon. Declik 1.1 manuel utilisateur. Technical report, Bull Research Center, August 1995.
6. D. Brand. Proving theorems with the modification method. SIAM Journal on Computing, 4:412-430, 1975.
7. C.-L. Chang and R. C.-T. Lee. Symbolic Logic and Mechanical Theorem Proving. New-York Academic Press, 1973.
8. M. C. Fitting. First-Order Logic and Automated Theorem Proving. Springer Vetlag, 1990.
9. S.-J. Lee and D. A. Plaisted. Eliminating duplication with the hyper-linking strategy. JACM, 28:193-214, 1981.
10. R. Letz, K. Mayr, and C. Goller. Controlled integration of the cut rule into connection tableau calculi. JAR, 13:297-338, 1994.
11. W. McCune. Otter 2.0 user's guide. Technical report, Argonne National Laboratory, 1990.
12. F. J. Pelletier. Seventy-five problems for testing automatic theorem provers. JAR, 2:191-216, 1986.
13. F. J. Pelletier. Errata. JAR, 8:235-236, 1988.
14. F. J. Pelletier and P. Rudnicki. Non-obviousness. AAR Newsletter, 6:4-5, 1986.
15. R. Socher-Ambrosius. How to avoid the derivation of redundant clauses in reasoning systems. JAR, 9:77-98, 1992.