Semantic selection of premisses for automated theorem proving

CEUR Workshop Proceedings

Volumn 257, Issue , 2007, Pages 27-44

  Pudlák, Petr ^a  

^a CHARLES UNIVERSITY   (Czech Republic)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATED MODELING; AUTOMATED THEOREM PROVER; AUTOMATED THEOREM PROVING; FIRST ORDER LOGIC; KNOWLEDGE IT; NOVEL ALGORITHM; OPTIMAL SETS; OPTIMAL SUBSETS;

ALGORITHMS; OPTIMIZATION; PROBLEM SOLVING; SEMANTICS; THEOREM PROVING;

AUTOMATION;

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

References (18)

1. Peter Baumgartner, Alexander Fuchs, Hans de Nivelle, and Cesare Tinelli. Computing finite models by reduction to function-free clause logic. to appear, preliminary version, June 2006.
2. Vašek Chvátal. A greedy heuristic for the set-covering problem. Math. Oper. Res., 4:233-235, 1979.
3. Koen Claessen and Niklas Sörensson. New techniques that improve MACE-style model finding. In Proc. of Workshop on Model Computation (MODEL), 2003.
4. Koen Claessen and Niklas Sörensson. Paradox - a first-order logic model finder. WWW pages, 2007. http://www.cs.chalmers.se/~koen/paradox/.
5. Alexander Fuchs, Peter Baumgartner, and Cesare Tinelli. Darwin - a theorem prover for the model evolution calculus. WWW pages, 2007. http://combination.cs.uiowa.edu/Darwin/.
6. Uriel Feige. A threshold of In(n) for approximating set cover. J. ACM, 45(4):634-652, 1998.
7. Richard Manning Karp. Reducibility among combinatorial problems. In Complexity of Computer Computations, pages 85-103. Plenum Press, 1972.
8. Jia Meng and Lawrence Paulson. Lightweight relevance filtering for machine-generated resolution. Volume 192 of CEUR Workshop Proceedings, 2006.
9. Petr Pudlák. Search for faster and shorter proofs using machine generated lemmas. In G. Sutcliffe, R. Schmidt, and S. Schulz, editors, Proceedings of the FLoC'06 Workshop on Empirically Successful Computerized Reasoning, 3rd International Joint Conference on Automated Reasoning, Volume 192 of CEUR Workshop Proceedings, pages 34-52, 2006.
10. Petr Pudlák. Verification of Mathematical Proofs. PhD thesis, Charles University in Prague, Faculty of Mathematics and Physics, 2006. Available online at http://lipa.ms.mff.cuni.cz/~pudlak/pp-thesis.pdf.
11. W. Reif and G. Schellhorn. Theorem proving in large theories. In W. Bibel and P. Schmitt, editors, Automated Deduction-A Basis for Applications, volume III, 2. Kluwer Academic Publishers, Dordrecht, 1998.
12. S. Schulz. E - A brainiac theorem prover. Journal of AI Communications, 15(2-3):111-126, 2002.
13. Stephan Schulz. The E equational theorem prover. WWW pages, 2007. http://www.eprover.org/.
14. Geoff Sutcliffe and Yury Puzis. SRASS - a semantic relevance axiom selection system, 2007. http://www.cs.miami.edu/~tptp/ATPSystems/SRASS/.
15. G. Sutcliffe and C. B. Suttner. The TPTP Problem Library: CNF Release v1.2.1. Journal of Automated Reasoning, 21(2):177-203, 1998.
16. Josef Urban. MizarMode - an integrated proof assistance tool for the Mizar way of formalizing mathematics. Journal of Applied Logic, 4(1):414-427, 2006.
17. Josef Urban. MoMM - fast interreduction and retrieval in large libraries of formalized mathematics. International Journal on Artificial Intelligence Tools, 15(1):109-130, 2006.
18. Josef Urban and Geoff Sutcliffe. The MPTP $ 100 Challenges, 2006. http://www.cs.miami.edu/~tptp/MPTPChallenge/.