Semantic selection for resolution in clause graphs

Lecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science)

Volumn 2557, Issue , 2002, Pages 83-94

  Choi, Seungyeob ^a   Kerber, Manfred ^a  

^a UNIVERSITY OF BIRMINGHAM   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATION THEORY; SEMANTICS;

CONNECTION GRAPHS; THEOREM PROVERS;

ARTIFICIAL INTELLIGENCE;

EID: 84943232020     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/3-540-36187-1_8     Document Type: Conference Paper

References (21)

1. A. Bundy, editor. Proceedings of the 12th CADE, LNAI814. Springer-Verlag, 1994.
2. R. Caferra and N. Peltier. Disinference rules, model building and abduction. In E. OrElowska, editor, Logic at Work: Essays Dedicated to the Memory of Helena Rasiowa, chapter 20, pages 331-353. Physica-Verlag, 1999.
3. S. Choi. Towards semantic goal-directed forward reasoning in resolution. In D. Scott, editor, Proceedings of the AIMSA'2002, LNAI2443, pages 243-252, 2002.
4. H. Chu and D.A. Plaisted. Semantically guided first-order theorem proving using hyper-linking. In Bundy [1], pages 192-206.
5. N. Eisinger. Completeness, Confluence, and Related Properties of Clause Graph Resolution. Research Notes in Artificial Intelligence. Pitman, London, 1991.
6. N. Eisinger and H.J. Ohlbach. The Markgraf Karl Refutation Procedure (MKRP). In J. Siekmann, editor, Proceedings of the 8th CADE, LNAI230, pages 681-682. Springer-Verlag, 1986.
7. K. Hodgson and J. Slaney. Development of a semantically guided theorem prover. In Goré et al. Proceedings of the IJCAR 2001, LNAI2083, pages 443-447. Springer-Verlag, 2001.
8. X. Huang, M. Kerber, M. Kohlhase, E. Melis, D. Nesmith, J. Richts, and J. Siekmann. KEIM: A toolkit for automated deduction. In Bundy [1], pages 807-810.
9. R. Kowalski. A proof procedure using connection graphs. Journal of the Association for Computing Machinery, 22(4):572-595, 1975.
10. S.J. Lee and D.A. Plaisted. Eliminating duplication with the hyper-linking strategy. Journal of Automated Reasoning, 9(1):25-42, 1992.
11. W. McCune. OTTER 3.0 Reference Manual and Guide. Mathematics and Computer Science Division, Argonne National Laboratory, Argonne, Illinois, USA, 1994.
12. W. McCune. Solution of the Robbins problem. Journal of Automated Reasoning, 19:263-276, 1997.
13. F.J. Pelletier. Seventy-five problems for testing automatic theorem provers. Journal of Automated Reasoning, 2(2):191-216, 1986.
14. D.A. Plaisted and Y. Zhu. Ordered semantic hyper-linking. Journal of Automated Reasoning, 25(3):167-217, 2000.
15. A. Riazanov and A. Voronkov. Vampire 1.1. In Goré et al. Proceedings of the IJCAR 2001, LNAI2083, pages 376-380. Springer-Verlag, 2001.
16. J.A. Robinson. A machine-oriented logic based on the resolution principle. Journal of the Association for Computing Machinery, 12(1):23-41, 1965.
17. J. Siekmann and G. Wrightson. An open research problem: Strong completeness of R. Kowalski's connection graph proof procedure. Logic Journal of the IGPL, 10(1):85-103, 2002.
18. J. Slaney. FINDER: Finite Domain Enumerator. In Bundy [1], pages 798-801.
19. J. Slaney, E. Lusk, and W. McCune. SCOTT: Semantically Constrained Otter. In Bundy [1], pages 764-768.
20. C. Weidenbach, B. Gaede, and G. Rock. SPASS & FLOTTER, Version 0.42. In M. A. McRobbie and J. K. Slaney, editors, Proceedings of the 13th CADE, LNAI 1104, pages 141-145. Springer-Verlag, 1996.
21. L. Wos, G.A. Robinson, and D.F. Carson. Efficiency and completeness of the set of support strategy in theorem proving. Journal of the Association for Computing Machinery, 12(4):536-541, 1965.