The goal of the present work is to design and prove correct several subalgorithms that are absolutely essential in order to obtain a complete variant ...

A theory-generic algorithms such as variant satisfiability manipulates metalevel data structures such as theories, signatures, equations, disequations, rewrite ...

Aug 18, 2016 · This paper: (i) gives a precise definition of several meta-level sub-algorithms needed for variant satisfiability; (ii) proves them correct; and ...

Abstract. Variant satisfiability is a theory-generic algorithm to decide quantifier-free satisfiability in an initial algebra TΣ/E when the the-.

This paper: (i) gives a precise definition of several meta-level sub-algorithms needed for variant satisfiability; (ii) proves them correct; and (iii) presents ...

This paper: (i) gives a precise definition of several meta-level sub-algorithms needed for variant satisfiability; (ii) proves them correct; and (iii) presents ...

TL;DR: A precise definition of several meta-level sub-algorithms needed for variant satisfiability checking is given; a reflective implementation of variant ...

Metalevel Algorithms for Variant Satisfiability. https://doi.org/10.1007/978-3-319-44802-2_10 · Full text. Journal: Rewriting Logic and Its Applications ...

This paper: (i) gives a precise definition of several meta-level sub-algorithms needed for variant satisfiability; (ii) proves them correct; and (iii) presents ...

Armando, A rewriting approach to satisfiability procedures, Inf. · Brainerd, Tree generating regular systems, Inf. · Clavel, Reflection in membership equational ...