Completion for Logically Constrained Rewriting

Abstract

We propose an abstract completion procedure for logically constrained term rewrite systems (LCTRSs). This procedure can be instantiated to both standard Knuth-Bendix completion and ordered completion for LCTRSs, and we present a succinct and uniform correctness proof. A prototype implementation illustrates the viability of the new completion approach. 2012 ACM Subject Classification Theory of computation → Rewrite systems, Theory of computation → Equational logic and rewriting, Theory of computation → Automated reasoning