Citius altius fortius: Lessons learned from the pheorem prover WALDMEISTER

Electronic Notes in Theoretical Computer Science

Volumn 86, Issue 1, 2003, Pages 9-21

  Hillenbrand, Thomas ^a  

^a MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; DATA STRUCTURES; DATABASE SYSTEMS; FUNCTIONS; MATHEMATICAL MODELS; THEOREM PROVING;

AUTOMATED DEDUCTION; DEDUCTIVE TECHNIQUES; EQUATIONAL DEDUCTION; INDEXING TECHNIQUES;

AUTOMATA THEORY;

EID: 18944407395     PISSN: 15710661     EISSN: None     Source Type: Journal    
DOI: 10.1016/S1571-0661(04)80649-2     Document Type: Conference Paper

References (27)

1. J. Avenhaus, J. Denzinger, and M. Fuchs. Discount: a system for distributed equational deduction. In J. Hsiang, editor, Proceedings of the 6th International Conference on Rewriting Techniques and Applications, volume 914 of LNCS, pages 397-402. Springer-Verlag, 1995.
2. Avenhaus J., Hillenbrand Th., Löchner B. On using ground joinable equations in equational theorem proving. Journal of Symbolic Computation. 2003;. To appear
3. J. Avenhaus, and B. Löchner. CCE: Testing ground joinability. In Proceedings of the 1st International Joint Conference on Automated Reasoning, volume 2083 of LNAI, pages 658-662. Springer-Verlag, 2001.
4. Bachmair L. Canonical Equational Proofs. 1991;Birkhäuser
5. Bachmair L., Dershowitz N., Plaisted D.A. Completion without failure. Resolution of Equations in Algebraic Structures, volume 2. 1989;1-30 Academic Press
6. H. Comon, P. Narendran, R. Nieuwenhuis, and M. Rusinowitch. Decision problems in ordered rewriting. In Proceedings of the 13th IEEE Symposium on Logics in Computer Science, pages 276-286. IEEE Computer Society, 1998.
7. J.-M. Gaillourdet, Th. Hillenbrand, B. Löchner, and H. Spies. The new Waldmeister loop at work. In F. Baader, editor, Proceedings of the 19th International Conference on Automated Deduction, LNAI. Springer-Verlag, 2003.
8. Graf P. Term Indexing, volume 1053 of LNCS. 1996;Springer-Verlag
9. Th. Hillenbrand, and B. Löchner. The next Waldmeister loop. In A. Voronkov, editor, Proceedings of the 18th International Conference on Automated Deduction, LNAI, pages 486-500. Springer-Verlag, 2002.
10. A. Jaeger. Anwendungen von Nachfolgermengen in Termersetzungssystemen. Projektarbeit, Universität Kaiserslautern, 1997.
11. Knuth D.E. The Art of Computer Programming, volume 3: Sorting and Searching. 2nd edition:1998;Addison-Wesley
12. W. Küchlin. An implementation and investigation of the Knuth-Bendix completion procedure. Interner Bericht 17/82, Universität Karlsruhe, Fakultät für Informatik, 1982.
13. D. S. Lankford and A. M. Ballantyne. Decision procedures for simple equational theories with commutative-associative axioms: Complete sets of commutative-associative reductions. Technical Report ATP-39, University of Texas, Austin, 1977.
14. E. L. Lusk. Controlling redundancy in large search spaces: Argonne-style theorem proving through the years (invited lecture). In A. Voronkov, editor, Proceedings of the 3rd International Conference on Logic Programming and Automated Reasoning, volume 624 of LNAI, pages 96-106. Springer-Verlag, 1992.
15. U. Martin and T. Nipkow. Ordered rewriting and confluence. In Proceedings of the 10th International Conference on Automated Deduction, volume 449 of LNCS, pages 366-380. Springer-Verlag, 1990.
16. McCune W. Experiments with discrimination-tree indexing and path indexing for term retrieval. Journal of Automated Reasoning. 9:(3):1992;147-167
17. W. McCune. Otter 3.0 reference manual and guide. Technical Report ANL-94/6, Argonne National Laboratory, 1994.
18. McCune W. 33 basic test problems: a practical evaluation of some paramodulation strategies. Veroff R. Automated Reasoning and its Applications: Essays in Honor of Larry Wos, chapter 5. 1997;71-114 MIT Press
19. R. Nieuwenhuis. Rewrite-based deduction and symbolic constraints (invited talk). In Proceedings of the 16th International Conference on Automated Deduction, volume 1632 of LNCS. Springer-Verlag, 1999.
20. R. Nieuwenhuis, Th. Hillenbrand, A. Riazanov, and A. Voronkov. On the evaluation of indexing techniques for theorem proving. In R. Goré, A. Leitsch, and T. Nipkow, editors, Proceedings of the First International Joint Conference on Automated Reasoning, volume 2083 of LNAI, pages 257-271. Springer-Verlag, 2001. See also http://www.mpi-sb.mpg.de/~hillen/compit.
21. Peterson G.E., Stickel M.E. Complete sets of reduction for some equational theories. Journal of the Association for Computing Machinery. 28:1981;233-264
22. Ramakrishnan I.V., Sekar R., Voronkov A. Term indexing. Robinson A., Voronkov A. Handbook of Automated Reasoning, volume II, chapter 26. 2001;1853-1964 Elsevier
23. A. Riazanov and A. Voronkov. Limited resource strategy in resolution theorem proving. Technical Report CSPP-7, University of Manchester, 2000. Accepted for publication in Journal of Symbolic Computation.
24. G. Sutcliffe and C. B. Suttner. The CADE ATP system competition. See http://www.cs.miami.edu/~tptp/CASC.
25. C. B. Suttner and G. Sutcliffe. The TPTP problem library (TPTP v2.2.0). Technical Report 99/02, James Cook University, Townsville, 1999.
26. A. Voronkov. Algorithms, datastructures, and other issues in efficient automated deduction (invited talk). In R. Goré, editor, Proceedings of the First International Joint Conference on Automated Reasoning, volume 2083 of LNAI, pages 13-28. Springer-Verlag, 2001.
27. Weidenbach Chr. Combining superposition, sorts and splitting. Robinson A., Voronkov A. Handbook of Automated Reasoning, volume II, chapter 27. 2001;1965-2013 Elsevier