Abstract
We show how a well-known superposition-based inference system for first-order equational logic can be used almost directly as a decision procedure for various theories including lists, arrays, extensional arrays and combinations of them. We also give a superposition-based decision procedure for homomorphism.
The authors would like to thank C. Ringeissen and L. Vigneron for their comments on a draft of this paper and the anonymous referees for helpful criticisms.
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
A. Armando and S. Ranise. A Practical Extension Mechanism for Decision Procedures: the Case Study of Universal Presburger Arithmetic. J. of Universal Computer Science, 7(2):124–140, February 2001.
L. Bachmair and H. Ganzinger. Rewrite-based equational theorem proving with selection and simplification. J. of Logic and Comp., 4(3):217–247, 1994.
L. Bachmair, I. V. Ramakrishnan, A. Tiwari, and L. Vigneron. Congruence closure modulo associativity and commutativity. In Frontiers of Comb. Sys.’s (FroCos’2000), LNCS 1794, pages 245–259, 2000.
L. Bachmair and A. Tiwari. Abstract congruence closure and specializations. In D. A. McAllester, editor, 17th CADE, LNAI 1831, pages 64–78, 2000.
R. Caferra and Peltier. Decision procedures using model building techniques. In CSL: 9th Workshop on Computer Science Logic. LNCS 1092, 1995.
N. Dershowitz and J.-P. Jouannaud. Rewrite systems. In J. van Leeuwen, editor, Hand. of Theoretical Comp. Science, pages 243–320. 1990.
H. B. Enderton. A Mathematical Introduction to Logic. Academic Pr., 1972.
D. E. Knuth and P. E. Bendix. Simple word problems in universal algebra. In J. Leech, editor, Computational Problems in Abstract Algebra, pages 263–297, Oxford, 1970. Pergamon Press.
E. Kounalis and M. Rusinowitch. On Word Problems in Horn Theories. JSC, 11(1&2):113–128, January/February 1991.
A. Leitsch. Deciding horn classes by hyperresolution. In CSL: 3rd Workshop on Computer Science Logic. LNCS, 1990.
C. Marché. The word problem of ACD-ground theories is undecidable. International Journal of Foundations of Computer Science, 3(1):81–92, 1992.
G. Nelson. Techniques for Program Verification. Technical Report CSL-81-10, Xerox Palo Alto Research Center, June 1981.
G. Nelson and D.C. Oppen. Simplification by Cooperating Decision Procedures. Technical Report STAN-CS-78-652, Stanford CS Dept., April 1978.
Greg Nelson and Derek C. Oppen. Fast decision procedures based on congruence closure. Journal of the ACM, 27(2):356–364, 1980.
P. Narendran and M. Rusinowitch. Any ground associative-commutative theory has a finite canonical system. In 4th RTA Conf., Como (Italy), 1991.
R. Nieuwenhuis and A. Rubio. Paramodulation-based theorem proving. In A. Robinson and A. Voronkov, editors, Hand. of Automated Reasoning. 2001.
M. Rusinowitch. Theorem-proving with Resolution and Superposition. JSC, 11(1&2):21–50, January/February 1991.
A. Stump, D. L. Dill, C. W. Barrett, and J. Levitt. A Decision Procedure for an Extensional Theory of Arrays. In LICS’01, 2001. To appear.
J. D. Ullman, A. V. Aho, and J. E. Hopcroft. The Design and Analysis of Computer Algorithms. Addison-Wesley, Reading, 1974.
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
Armando, A., Ranise, S., Rusinowitch, M. (2001). Uniform Derivation of Decision Procedures by Superposition. In: Fribourg, L. (eds) Computer Science Logic. CSL 2001. Lecture Notes in Computer Science, vol 2142. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44802-0_36
Download citation
DOI: https://doi.org/10.1007/3-540-44802-0_36
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42554-0
Online ISBN: 978-3-540-44802-0
eBook Packages: Springer Book Archive