DMCA
Equational Formulae with Membership Constraints (1994)
| Venue: | Information and Computation |
| Citations: | 38 - 3 self |
BibTeX
@ARTICLE{Comon94equationalformulae,
author = {Hubert Comon and Catherine Delor},
title = {Equational Formulae with Membership Constraints},
journal = {Information and Computation},
year = {1994},
volume = {112},
pages = {167--216}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
We propose a set of transformation rules for first order formulae whose atoms are either equations between terms or "membership constraints" t 2 i. i can be interpreted as a regular tree language (i is called a sort in the algebraic specification community) or as a tree language in any class of languages which satisfies some adequate closure and decidability properties. This set of rules is proved to be correct, terminating and complete. This provides a quantifier elimination procedure: for every regular tree language L, the first order theory of some structure defining L is decidable. This extends the results of Mal'cev (1971), Maher (1988), Comon and Lescanne (1989). We also show how to apply our results to automatic inductive proofs in equational theories. Introduction To unify two terms s and t means to turn the equation s = t into an equivalent solved form which is either ? (this means that s = t has no solution, or, in other words, that s and t are not unifiable) or else a form...
