A rewriting approach to satisfiability procedures

https://doi.org/10.1016/S0890-5401(03)00020-8Get rights and content
Under an Elsevier user license
open archive

Abstract

We show how a well-known superposition-based inference system for first-order equational logic can be used almost directly for deciding satisfiability in various theories including lists, encryption, extensional arrays, extensional finite sets, and combinations of them. We also give a superposition-based decision procedure for homomorphism.

Keywords

Automated deduction
Equational logic
Term rewriting
Superposition
Decision procedures
Lists
Encryption
Arrays with extensionality
Finite sets with extensionality
Homomorphism

Cited by (0)

Some preliminary results have appeared in [2].