The Next Waldmeister Loop-Reference-Cited by-同舟云学术

The Next Waldmeister Loop

Published:2002 Issue: Volume: Page:486-500
ISSN:0302-9743
Container-title:Automated Deduction—CADE-18
language:
Short-container-title:

Author:

Hillenbrand Thomas,Löchner Bernd

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/3-540-45620-1_38

Reference14 articles.

1. Lect Notes Comput Sci;J. Avenhaus,1995

2. N. Dershowitz and D. A. Plaisted. Rewriting. In A. Robinson and A. Voronkov, eds., Handbook of Automated Reasoning, volume I, 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 MPI-I-2001-2-006, pp. 13–21. Max-Planck-Institut für Informatik Saarbrücken, 2001.

Cited by 9 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. A Comprehensive Framework for Saturation Theorem Proving;Automated Reasoning;2020

2. Computer Runtimes and the Length of Proofs;Computation, Physics and Beyond;2012

3. Termination Tools in Ordered Completion;Automated Reasoning;2010

4. Mining Propositional Simplification Proofs for Small Validating Clauses;Electronic Notes in Theoretical Computer Science;2006-01

5. Reflecting Proofs in First-Order Logic with Equality;Automated Deduction – CADE-20;2005