Abstract
Redundancy elimination is a key feature for the efficiency of saturation based theorem provers. Ground joinability is a good candidate for a redundancy criterion but is rarely used in practice since the available algorithms are not believed to have a good cost-benefit ratio. In order to have a framework for the evaluation and the design of new methods for testing ground joinability we developed the system CCE.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
J. Avenhaus, T. Hillenbrand, B. Löchner (2000). On Using Ground Joinable Equations in Equational Theorem Proving. In Proc. FTP 2000, Fachberichte Informatik 5/2000, Universität Koblenz-Landau. Extended version submitted for publication.
L. Bachmair and H. Ganzinger (1994). Rewrite-based Equational Theorem Proving with Selection and Simplification. J. Logic and Computation, 4, pages 217–247.
H. Comon, P. Narendran, R. Nieuwenhuis, and M. Rusinowitch (1998). Decision Problems in Ordered Rewriting. In Proc. 13th LICS, IEEE Computer Society, pages 276–286.
T. Hillenbrand, A. Jaeger, and B. Löchner (1999). System description: Waldmeister-Improvements in Performance and Ease of Use. In Proc. CADE-16, LNAI 1632, pages 232–236.
K. Korovin and A. Voronkov (2000). A Decision Procedure for the Existential Theory of Term Algebras with the Knuth-Bendix Ordering. In Proc. LICS 2000, IEEE Computer Society, pages 291–302.
U. Martin and T. Nipkow (1990). Ordered rewriting and confluence. In Proc. CADE-10, LNCS 449, pages 366–380.
Robert Nieuwenhuis (1993). Simple LPO constraint solving methods. Information Processing Letters, 47, pages 65-69.
R. Nieuwenhuis and J. M. Rivero (1999). Solved Forms for Path Ordering Constraints. In Proc. 10th RTA, LNCS 1631, pages 1–15.
G. Sutcli_e and G. Suttner (1998). The TPTP Problem Library. CNF Release v.1.2.1. J. Automated Reasoning, 21, pages 177–203.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Avenhaus, J., Löchner, B. (2001). CCE: Testing Ground Joinability. In: Goré, R., Leitsch, A., Nipkow, T. (eds) Automated Reasoning. IJCAR 2001. Lecture Notes in Computer Science, vol 2083. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45744-5_53
Download citation
DOI: https://doi.org/10.1007/3-540-45744-5_53
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42254-9
Online ISBN: 978-3-540-45744-2
eBook Packages: Springer Book Archive