The next WALDMEISTER loop

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2392, Issue , 2002, Pages 486-500

  Hillenbrand, Thomas ^a   Löchner, Bernd ^b  

^a MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

^b Rheinland Pfälzische Technische Universität Kaiserslautern Landau   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATION;

COMPRESSION SCHEME; MEMORY CONSUMPTION; PREVENTIVE MEASURES; REASONING PROCESS; THEOREM PROVERS;

THEOREM PROVING;

EID: 84948974693     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45620-1_38     Document Type: Conference Paper

References (14)

1. J. Avenhaus, J. Denzinger, and M. Fuchs. Discount: a system for distributed equational deduction. In J. Hsiang, ed., Proceedings of the 6th International Conference on Rewriting Techniques and Applications, volume 914 of LNCS, pp. 397–402. Springer-Verlag, 1995.
2. N. Dershowitz and D. A. Plaisted. Rewriting. In A. Robinson and A. Voronkov, eds., Handbookof Automated Reasoning, volume 1, chapter 9, pp. 535–610. Elsevier, 2001.
3. P. Graf. Term Indexing, volume 1053 of LNAI. Springer-Verlag, 1996.
4. Th. Hillenbrand. Schnelles Gleichheitsbeweisen: Vom Vervollständigungskalk ül zum Waldmeister-System. Diplomarbeit, Universität Kaiserslautern, Fachbereich Informatik, 2000. Available via http://www.mpi-sb.mpg.de/∼hillen/documents/SchnellesBeweisen.ps.gz.
5. Th. Hillenbrand and B. Löchner. The next Waldmeister loop (extended abstract). In H. de Nivelle and S. Schulz, eds., Proceedings of the Second International Workshop on Implementation of Logics, Technical Report MPII- 2001-2-006, pp. 13–21. Max-Planck-Institut für Informatik Saarbrücken, 2001.
6. W. Küchlin. An implementation and investigation of the Knuth-Bendix completion procedure. Interner Bericht 17/82, Universität Karlsruhe, 1982.
7. B. Löchner and S. Schulz. An evaluation of shared rewriting. In H. de Nivelle and S. Schulz, eds., Proceedings of the Second International Workshop on Implementation of Logics, Technical Report MPI-I-2001-2-006, pp. 33–48. Max-Planck-Institut für Informatik Saarbrücken, 2001.
8. W. McCune. Otter 3.0 reference manual and guide. Technical Report ANL-94/6, Argonne National Laboratory, 1994.
9. W. McCune. 33 basic test problems: a practical evaluation of some paramodulation strategies. In R. Veroff, ed., Automated Reasoning and its Applications: Essays in Honor of Larry Wos, chapter 5, pp. 71–114. MIT Press, 1997.
10. I. V. Ramakrishnan, R. Sekar, and A. Voronkov. Term indexing. In A. Robinson and A. Voronkov, eds., Handbookof Automated Reasoning, volume 2, chapter 26, pp. 1853–1964. Elsevier, 2001.
11. A. Riazanovand 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.
12. C. B. Suttner and G. Sutcliffe. The TPTP problem library (TPTP v2.2.0). Technical Report 99/02, James Cook University, Townsville, 1999.
13. A. Voronkov. Algorithms, datastructures, and other issues in efficient automated deduction (invited talk). In R. Goré, A. Leitsch, and T. Nipkow, eds., Proceedings of the First International Joint Conference on Automated Reasoning, volume 2083 of LNAI, pp. 13–28. Springer-Verlag, 2001.
14. Chr. Weidenbach. Combining superposition, sorts and splitting. In A. Robinson and A. Voronkov, eds., Handbookof Automated Reasoning, volume 2, chapter 27, pp. 1965–2013. Elsevier, 2001.