randoCoP: Randomizing the proof search order in the connection calculus

CEUR Workshop Proceedings

Volumn 373, Issue , 2008, Pages 94-102

  Raths, Thomas ^a   Otten, Jens ^a  

^a UNIVERSITY OF POTSDAM   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

FIRST ORDER LOGIC; INCOMPLETE SEARCHES; LITERALS; PROOF SEARCH; RANDOMIZED SEARCH; THEOREM PROVERS; TPTP LIBRARY;

FORMAL LOGIC; OPEN SYSTEMS;

THEOREM PROVING;

EID: 77950263531     PISSN: 16130073     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (23)

1. W. Bibel. Matings in matrices. Communications of the ACM, 26:844-852, 1983.
2. W. Bibel. Automated Theorem Proving. Vieweg, second edition, 1987.
3. K. Classen. Equinox, a new theorem prover for full first-order logic with equality. In Dagstuhl Seminar 05431 on Deduction and Applications, 2005.
4. W. Ertel. OR-parallel theorem proving with random competition. In A. Voronkov, Ed., LPAR'92, LNAI 624, pp. 226-237. Springer, 1992.
5. K. Korovin. Implementing an instantiation-based theorem prover for first-order logic. In C. Benzmueller, B. Fischer, G. Sutcliffe IWIL-6, 2006.
6. C. Kreitz, J. Otten. Connection-based theorem proving in classical and nonclassical logics. Journal of Universal Computer Science, 5:88-112, Springer, 1999.
7. R. Letz, J. Schumann, S. Bayerl, W. Bibel. SETHEO: a high-performance theorem prover. Journal of Automated Reasoning, 8:183-212, 1992.
8. R. Letz, G. Stenz Model elimination and connection tableau procedures. Handbook of Automated Reasoning, pp. 2015-2114, Elsevier, 2001.
9. D. Loveland. Mechanical theorem proving by model elimination. JACM, 15:236-251, 1968.
10. W. McCune. Otter 3.0 reference manual and guide. Technical Report ANL- 94/6, Argonne National Laboratory, 1994.
11. W. McCune. Release of Prover9. Mile High Conference on Quasigroups, Loops and Nonassociative Systems, Denver, Colorado, 2005.
12. J. Otten. Clausal connection-based theorem proving in intuitionistic first-order logic. TABLEAUX 2005, LNAI 3702, pages 245-261, Springer, 2005.
13. J. Otten. Restricting backtracking in connection calculi. Technical report, Institut für Informatik, University of Potsdam, 2008.
14. J. Otten. leanCoP 2.0 and ileanCoP 1.2: high performance lean theorem proving in classical and intuitionistic logic. IJCAR 2008. LNCS, Springer, 2008.
15. J. Otten, W. Bibel. leanCoP: lean connection-based theorem proving. Journal of Symbolic Computation, 36:139-161, 2003. (Pubitemid 36836838)
16. A. Riazanov, A. Voronkov. The design and implementation of Vampire. AI Communications 15(2-3): 91-110, 2002. (Pubitemid 34838658)
17. S. Schulz. E - a brainiac theorem prover. AI Communications, 15(2):111-126, 2002. (Pubitemid 34838659)
18. G. Sutcliffe, C. Suttner. The TPTP problem library - CNF release v1.2.1. Journal of Automated Reasoning, 21: 177-203, 1998. (Pubitemid 128514347)
19. M. Stickel, R. Waldinger, M. Lowry, T. Pressburger, I. Underwood. Deductive composition of astronomical software from subroutine libraries. In A. Bundy, Ed., CADE-12, LNCS 814, pp. 341-355, Springer, 1994.
20. J. Urban. MPTP 0.2: design, implementation, and initial experiments. Journal of Automated Reasoning, 37:21-43, 2006. (Pubitemid 46154516)
21. A. Waaler. Connections in nonclassical logics. Handbook of Automated Reasoning, pp. 1487-1578, Elsevier, 2001.
22. L. Wallen. Automated deduction in nonclassical logic. MIT Press, 1990.
23. C. Weidenbach, R. A. Schmidt, T. Hillenbrand, R. Rusev, D. Topic. System description: SPASS version 3.0. In F. Pfenning, Ed., CADE-21, LNCS 4603, pp. 514-520. Springer, 2007. (Pubitemid 47545134)