Conditional Congruence Closure over Uninterpreted and Interpreted Symbols
Author:
- 14 February 2019
- journal article
- research article
- Published by Springer Nature in Journal of Systems Science and Complexity
- Vol. 32 (1) , 317-355
Abstract
No abstract availableKeywords
This publication has 21 references indexed in Scilit:
- Constraint solving for interpolationJournal of Symbolic Computation, 2010
- Term Rewriting and All That1998
- Shostak's congruence closure as completion1997
- Mechanically verifying a family of multiplier circuits1996
- An overview of Rewrite Rule Laboratory (RRL)Computers & Mathematics with Applications, 1995
- Fast algorithms for testing unsatisfiability of ground horn clauses with equationsJournal of Symbolic Computation, 1987
- Linear-time algorithms for testing the satisfiability of propositional horn formulaeThe Journal of Logic Programming, 1984
- Variations on the Common Subexpression ProblemJournal of the ACM, 1980
- Fast Decision Procedures Based on Congruence ClosureJournal of the ACM, 1980
- An algorithm for reasoning about equalityCommunications of the ACM, 1978