Uniform derivation of decision procedures by superposition

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2142, Issue , 2001, Pages 513-527

  Armando, Alessandro ^a   Ranise, Silvio ^a,b   Rusinowitch, Michaël ^b  

^a UNIVERSITY OF GENOA   (Italy)

^b LORIA   (France)

Author keywords

Arrays with extensionality; Automated deduction; Decision procedures; Equational logic; Homomorphism; Lists; Superposition; Term rewriting

Indexed keywords

AUTOMATED DEDUCTION; DECISION PROCEDURE; EQUATIONAL LOGIC; EXTENSIONALITY; HOMOMORPHISM; LISTS; SUPERPOSITION; TERM REWRITING;

COMPUTER CIRCUITS;

EID: 15544374811     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44802-0_36     Document Type: Conference Paper

References (19)

1. A. Armando and S. Ranise. A Practical Extension Mechanism for Decision Procedures: the Case Studyof Universal Presburger Arithmetic. J. of Universal Computer Science, 7(2):124-140, February 2001.
2. L. Bachmair and H. Ganzinger. Rewrite-based equational theorem proving with selection and simplification. J. of Logic and Comp., 4(3):217-247, 1994.
3. L. Bachmair, I. V. Ramakrishnan, A. Tiwari, and L. Vigneron. Congruence closure modulo associativityand commutativity. In Frontiers of Comb. Sys.’s (FroCos’2000), LNCS 1794, pages 245-259, 2000.
4. L. Bachmair and A. Tiwari. Abstract congruence closure and specializations. In D. A. McAllester, editor, 17th CADE, LNAI 1831, pages 64-78, 2000.
5. R. Caferra and O Peltier. Decision procedures using model building techniques. In CSL: 9th Workshop on Computer Science Logic. LNCS 1092, 1995.
6. N. Dershowitz and J.-P. Jouannaud. Rewrite systems. In J. van Leeuwen, editor, Hand. of Theoretical Comp. Science, pages 243-320. 1990.
7. H. B. Enderton. A Mathematical Introduction to Logic. Academic Pr., 1972.
8. 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. KR91.
9. E. Kounalis and M. Rusinowitch. On Word Problems in Horn Theories. JSC, 11(1&2):113-128, January/February 1991.
10. A. Leitsch. Deciding horn classes byh yperresolution. In CSL: 3rd Workshop on Computer Science Logic. LNCS, 1990.
11. C. Marché. The word problem of ACD-ground theories is undecidable. International Journal of Foundations of Computer Science, 3(1):81-92, 1992.
12. G. Nelson. Techniques for Program Verification. Technical Report CSL-81- 10, Xerox Palo Alto Research Center, June 1981.
13. G. Nelson and D.C. Oppen. Simplification byCo operating Decision Procedures. Technical Report STAN-CS-78-652, Stanford CS Dept., April 1978.
14. Greg Nelson and Derek C. Oppen. Fast decision procedures based on congruence closure. Journal of the ACM, 27(2):356-364, 1980.
15. P. Narendran and M. Rusinowitch. Anyground associative-commutative theoryhas a finite canonical system. In 4th RTA Conf., Como (Italy), 1991.
16. R. Nieuwenhuis and A. Rubio. Paramodulation-based theorem proving. In A. Robinson and A. Voronkov, editors, Hand. of Automated Reasoning. 2001.
17. M. Rusinowitch. Theorem-proving with Resolution and Superposition. JSC, 11(1&2):21-50, January/February 1991.
18. A. Stump, D. L. Dill, C. W. Barrett, and J. Levitt. A Decision Procedure for an Extensional Theoryof Arrays. In LICS’01, 2001. To appear.
19. J. D. Ullman, A. V. Aho, and J. E. Hopcroft. The Design and Analysis of Computer Algorithms. Addison-Wesley, Reading, 1974.