Filters








4 Hits in 1.4 sec

randoCoP: Randomizing the Proof Search Order in the Connection Calculus

Thomas Raths, Jens Otten
2008 Conference on Automated Deduction  
We present randoCoP, a theorem prover for classical firstorder logic, which integrates randomized search techniques into the connection prover leanCoP 2.0.  ...  By randomly reordering the axioms of the problem and the literals within its clausal form, the incomplete search variants of leanCoP 2.0 can be improved significantly.  ...  The authors would like to thank the referees for their useful comments, which have helped to improve this paper.  ... 
dblp:conf/cade/RathsO08 fatcat:n732hqkxt5g55ccf6hxxzy76yu

Monte Carlo Tableau Proof Search [chapter]

Michael Färber, Cezary Kaliszyk, Josef Urban
2017 Lecture Notes in Computer Science  
We study Monte Carlo Tree Search to guide proof search in tableau calculi. This includes proposing a number of proof-state evaluation heuristics, some of which are learnt from previous proofs.  ...  The system is trained and evaluated on a large suite of related problems coming from the Mizar proof assistant, showing that it is capable to find new and different proofs.  ...  Clausal Connection Calculus The connection calculus is a goal-directed proof search procedure (Bibel 1993) .  ... 
doi:10.1007/978-3-319-63046-5_34 fatcat:ryaw5wlcnrhdblcf3hknznbk3q

Efficient Low-Level Connection Tableaux [chapter]

Cezary Kaliszyk
2015 Lecture Notes in Computer Science  
In this paper we discuss low-level representations for first-order tableaux theorem proving and present the Bare Metal Tableaux Prover, a C implementation of the exact calculus used in the leanCoP theorem  ...  In particular, this is the case for leanCoP, the only tableaux prover that regularly takes part in the CASC, the yearly ATP competition.  ...  Introduction Connection tableaux is a well-studied calculus for automating first-order classical logic proofs.  ... 
doi:10.1007/978-3-319-24312-2_8 fatcat:wb4nnbmkcrdzddohszhm7utoc4

CASC-J4 The 4th IJCAR ATP System Competition [chapter]

Geoff Sutcliffe
Lecture Notes in Computer Science  
The evaluation is in terms of the number of problems solved, the number of acceptable proofs and models produced, and the average runtime for problems solved, in the context of a bounded number of eligible  ...  The CADE ATP System Computer (CASC) evaluates the performance of sound, fully automatic, classical first-order logic, ATP systems.  ...  Version 1.1 of randoCoP returns a compact connection proof, which is then translated into a readable proof. The source code of randoCoP is available at http://www.leancop.de.  ... 
doi:10.1007/978-3-540-71070-7_38 fatcat:jrwog4rodnhfrnekiydks4nmzi