A rewriting approach to satisfiability procedures
Top Cited Papers
- 1 June 2003
- journal article
- Published by Elsevier in Information and Computation
- Vol. 183 (2) , 140-164
- https://doi.org/10.1016/s0890-5401(03)00020-8
Abstract
No abstract availableKeywords
This publication has 20 references indexed in Scilit:
- Uniform Derivation of Decision Procedures by SuperpositionPublished by Springer Nature ,2001
- Automated complexity analysis based on ordered resolutionJournal of the ACM, 2001
- Abstract Congruence Closure and SpecializationsPublished by Springer Nature ,2000
- Congruence Closure Modulo Associativity and CommutativityPublished by Springer Nature ,2000
- Decision procedures using model building techniquesPublished by Springer Nature ,1996
- Towards a foundation of completion procedures as semidecision proceduresTheoretical Computer Science, 1995
- Rewrite-based Equational Theorem Proving with Selection and SimplificationJournal of Logic and Computation, 1994
- BDDs and automated deductionPublished by Springer Nature ,1994
- Rewrite SystemsPublished by Elsevier ,1990
- Variations on the Common Subexpression ProblemJournal of the ACM, 1980