A rewriting approach to satisfiability procedures☆
Under an Elsevier user license
open archive
Keywords
Automated deduction
Equational logic
Term rewriting
Superposition
Decision procedures
Lists
Encryption
Arrays with extensionality
Finite sets with extensionality
Homomorphism
Cited by (0)
Copyright © 2003 Elsevier Science (USA). All rights reserved.