Compiling dyadic first-order specifications into map algebra
Two techniques are designed for eliminating quantifiers from an existentially quantified conjunction of dyadic literals, in terms of the operators o, boolean AND, and (-1) of the Tarski-Chin-Givant formalism of relations. The use of such techniques is illustrated through increasingly challenging examples, and their algorithmic complexity is assessed. (C) 2002 Elsevier Science B.V. All rights reserved.
algebraic logic quantifier elimination computational complexity