Shostak’s congruence closure as completion

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

Volumn 1232, Issue , 1997, Pages 23-37

  Kapur, Deepak ^a  

^a State University of New York   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SCIENCE; COMPUTERS;

CONGRUENCE CLOSURE; GROUND TERMS; QUADRATIC ALGORITHMS; REWRITE RULES; REWRITING SYSTEMS; SUBTERMS;

ARTIFICIAL INTELLIGENCE;

EID: 84947715642     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-62950-5_59     Document Type: Conference Paper

References (17)

1. D. Craigen, S. Kromodimoelijo, I. Meisels, W. Pase, and M. Saaltink, "Eves system description," Proc. Automated Deduction - CADE 11, LNAI 607 (ed. Kapur), Springer Verlag (1992), 771-775.
2. D. Cyrluk, P. Lincoln, and N. Shankar, "On Shostak's decision procedures for combination of theories," Proc. Automated Deduction - CADE 13, LNAI 1104 (eds. McRobbie and Slaney), Springer Verlag (1996), 463-477.
3. P.J. Downey, R. Sethi, and R.E. Tarjan, "Variations on the common subexpression problem," JACM, 27(4) (1980), 758-771
4. Z. Fülöp, and S. Vagvölgyi, "Ground term rewriting rules for the word problem of ground term equations," Bulletin of the EATCS, 45 (1991), 186-201.
5. G. Huet and D. Lankford, On the Uniform Halting Problem for Term Rewriting Systems. INRIA Report 283, March 1978.
6. D. Kapur and M. Subramaniam, "New uses of linear arithmetic in automated theorem proving for induction," J. Automated Reasoning, 16(1-2) (1996), 39-78
7. D. Kapur and M. Subramaniam, "Mechanically verifying a family of multiplier circuits," Proc. Computer Aided Verification fCAVJ, New Jersey, Springer LNCS 1102 (eds. R. Alur and T.A. Henzinger) (1996), 135-146
8. D. Kapur and H. Zhang, "An overview of Rewrite Rule Laboratory (RRL), " Computers and Math, with Applications, 29(2) (1995), 91-114.
9. D. Kozen, Complexity of Finitely Presented Algebras. Technical Report TR 76-294, Dept, of Computer Science, Cornell Univ., Ithaca, NY, 1976.
10. D. Knuth and P. Bendix, "Simple word problems in universal algebras," in Computational Problems in Abstract Algebra (ed. Leech), Pergamon Press (1970), 263-297.
11. G. Nelson, and D.C. Oppen, "Simplification by cooperating decision procedures," ACM Tran, on Programming Languages and Systems 1 (2) (1979) 245-257.
12. G. Nelson, and D.C. Oppen, "Fast decision procedures based on congruence closure," JACM, 27(2) (1980), 356-364.
13. D. Plaisted, and A. Sattler-Klein, "Proof lengths for equational completion," Information and Computation, 125 (1996), 154-170.
14. R.E. Shostak, "An algorithm for reasoning about equality," Communications of ACM, 21(7) (1978), 583-585.
15. R.E. Shostak, "Deciding combination of theories," Journal of ACM 31 (1), (1984) 1-12.
16. W. Snyder, "A fast algorithm for generating reduced ground rewriting system from a set of ground equations," J. Symbolic Computation, 1992.
17. H. Zhang, "Implementing contextual rewriting," Proc. Third International Workshop on Conditional Term Rewriting Systems, Springer LNCS 656 (eds. J. L. Remy and M. Rusinowitch), (1992), 363-377.