We address the general problem of determining the validity of boolean combinations of equalities and inequalities between real-valued expressions. In particular, we consider methods of establishing such assertions using only restricted forms of distributivity. At the same time, we explore ways in which “local” decision or heuristic procedures for fragments of the theory of the reals can be amalgamated into global ones. Let Tadd [Q] be the first-order theory of the real numbers in the language with symbols 0, 1,+,−,
CITATION STYLE
Avigad, J., & Friedman, H. (2006). Combining decision procedures for the reals. Logical Methods in Computer Science, 2(4). https://doi.org/10.2168/LMCS-2(4:4)2006
Mendeley helps you to discover research relevant for your work.