Abstract
We use clauses with ordering constraints to reduce the search space in ordered inference systems for clauses with or without equality, such as ordered resolution or superposition. In our completion procedure for ordering constrained clauses redundant inferences can be ignored and redundant clauses can be deleted without loosing refutational completeness. Two new results needed for fast ordering constraint solving and incrementality of the set of function symbols are given. We discuss the use of our methods for reasoning about infinite sets of clauses defined by a finite number of ordering constrained ones.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
L. Bachmair, H. Ganzinger: On restrictions of ordered paramodulation with simplification. In Proc. 10th CADE, Kaiserslautern, LNCS 449, 1990.
L. Bachmair, H. Ganzinger: Rewrite-based equational theorem proving with selection and simplification, Report 208 Max-Planck Inst. Saarbrücken, 1991.
H. Comon: Solving Symbolic Ordering Constraints. In proc. 5th IEEE Symp. Logic in Comp. Sc. Philadelphia. (1990).
N. Dershowitz, J-P. Jouannaud: Rewrite systems, in Handbook of Theoretical Comp. Sc. vol. B: Formal Methods and Semantics. North Holland, 1990.
J. Hsiang, M. Rusinowitch: Proving refutational completeness of theorem proving strategies: The transfinite semantic tree method. Submitted. (1989).
G. Huet: Constrained Resolution: A complete method for higher-order logic. PhD. Thesis. Case Western Reserve University. 1972.
J.M. Hullot: Compilation de Formes Canoniques dans les Teories Equationnelles, These de 3eme Cycle, Universite de Paris Sud, 1980.
J-P. Jouannaud, M. Okada: Satisfiability of systems of ordinal notations with the subterm property is decidable, ICALP 1991, LNCS 510, Madrid, 1991.
D.E. Knuth, P.B. Bendix: Simple word problems in universal algebras. J. Leech, editor, Computational Problems in Abstract Algebra, 263–297, Pergamon Press, Oxford, 1970.
C. Kirchner and H. Kirchner, M. Rusinowitch: Deduction with Symbolic Constraints, Revue Francaise d'Intelligence Artificielle, Vol 4, no. 3, pp. 9–52, 1990.
R. Nieuwenhuis, P. Nivela: Efficient deduction in equality Horn logic by Horn-completion, Information Processing Letters, no. 39, pp. 1–6, July 1991.
R. Nieuwenhuis, F. Orejas: Clausal Rewriting, 2nd Intl. Workshop on Conditional and Typed Term Rewriting, Montreal LNCS 516, pp. 246–261, (1991).
R. Nieuwenhuis, F. Orejas, A. Rubio: TRIP: an implementation of clausal rewriting, Proc. 10th Int. Conf. on Automated Deduction, Kaiserslautern, LNCS 449, pp. 667–668 (1990).
R. Nieuwenhuis, A. Rubio: Basic Superposition is Complete, Proc. European Symposium On Programming, Rennes, France, LNCS, February 1992.
G.E. Peterson: Complete Sets of Reductions with Constraints, Proc. 10th Int. Conf. on Automated Deduction, Kaiserslautern, LNCS 449, pp. 381–395 (1990).
A. Rubio, R. Nieuwenhuis: Handling ordering constraints of clauses in theorem proving, Research Report LSI-UPC, 1991.
H. Zhang: Reduction, Superposition, and Induction: Automated Reasoning in an Equational Logic, PhD. Thesis, Renselaer Polytechnic Institute, (1988).
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1992 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Nieuwenhuis, R., Rubio, A. (1992). Theorem proving with ordering constrained clauses. In: Kapur, D. (eds) Automated Deduction—CADE-11. CADE 1992. Lecture Notes in Computer Science, vol 607. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-55602-8_186
Download citation
DOI: https://doi.org/10.1007/3-540-55602-8_186
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-55602-2
Online ISBN: 978-3-540-47252-0
eBook Packages: Springer Book Archive