Abstract
During the last years, several saturation-based theorem proving techniques for full first-order (ordering and /or equality constrained) clauses with equality have emerged.
We would like to thank Harald Ganzinger for inviting us to the Max-Planck-Institut für Informatik, Saarbrücken, Germany, and for his encouragement to carry out this work during our half-year stay there.
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
Leo Bachmair and Harald Ganzinger. Rewrite-based equational theorem proving with selection and simplification. Technical Report MPI-I-91-208, Max-Planck-Institut für Informatik, Saarbrücken, August 1991. To appear in Journal of Logic and Computation.
Leo Bachmair, Harald Ganzinger, Christopher Lynch, and Wayne Snyder. Basic paramodulation and superposition. In Deepak Kapur, editor, 11th International Conference on Automated Deduction, LNAI 607, pages 462–476, Saratoga Springs, New York, USA, June 15–18, 1992. Springer-Verlag.
Hubert Comon. Solving symbolic ordering constraints. International Journal of Foundations of Computer Science, 1(4):387–411, 1990.
Ursula Martin and Tobias Nipkow. Ordered rewriting and confluence. In Mark E. Stickel, editor, 10th International Conference on Automated Deduction, LNAI 449, pages 366–380, Kaiserslautern, FRG, July 24–27, 1990. Springer-Verlag.
Robert Nieuwenhuis and Pilar Nivela. Efficient deduction in equality horn logic by horn-completion. Information Processing Letters, 39(l):1–6, July 1991.
Robert Nieuwenhuis and Albert Rubio. Basic superposition is complete. In B. Krieg-Brückner, editor, European Symposium on Programming, LNCS 582, pages 371–390, Rennes, France, February 26–28, 1992. Springer-Verlag.
Robert Nieuwenhuis and Albert Rubio. Theorem proving with ordering constrained clauses. In Deepak Kapur, editor, 11th International Conference on Automated Deduction, LNAI 607, pages 477–491, Saratoga Springs, New York, USA, June 15–18, 1992. Springer-Verlag.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1993 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Nivela, P., Nieuwenhuis, R. (1993). Saturation of first-order (constrained) clauses with the Saturate system. In: Kirchner, C. (eds) Rewriting Techniques and Applications. RTA 1993. Lecture Notes in Computer Science, vol 690. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-21551-7_33
Download citation
DOI: https://doi.org/10.1007/978-3-662-21551-7_33
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-56868-1
Online ISBN: 978-3-662-21551-7
eBook Packages: Springer Book Archive