Shostak's congruence closure as completion
Author:
- 1 January 1997
- book chapter
- Published by Springer Nature
- p. 23-37
Abstract
No abstract availableKeywords
This publication has 14 references indexed in Scilit:
- New uses of linear arithmetic in automated theorem proving by inductionJournal of Automated Reasoning, 1996
- Proof Lengths for Equational CompletionInformation and Computation, 1996
- On Shostak's decision procedure for combinations of theories1996
- Mechanically verifying a family of multiplier circuits1996
- An overview of Rewrite Rule Laboratory (RRL)Computers & Mathematics with Applications, 1995
- Deciding Combinations of TheoriesJournal of the ACM, 1984
- Variations on the Common Subexpression ProblemJournal of the ACM, 1980
- Fast Decision Procedures Based on Congruence ClosureJournal of the ACM, 1980
- Simplification by Cooperating Decision ProceduresACM Transactions on Programming Languages and Systems, 1979
- An algorithm for reasoning about equalityCommunications of the ACM, 1978