Date of Original Version



Conference Proceeding

Rights Management

The final publication is available at Springer via

Abstract or Description

We describe a general method for verifying inequalities between real-valued expressions, especially the kinds of straightforward inferences that arise in interactive theorem proving. In contrast to approaches that aim to be complete with respect to a particular language or class of formulas, our method establishes claims that require heterogeneous forms of reasoning, relying on a Nelson-Oppen-style architecture in which special-purpose modules collaborate and share information. The framework is thus modular and extensible. A prototype implementation shows that the method is promising, complementing techniques that are used by contemporary interactive provers.



Included in

Philosophy Commons



Published In

Lecture Notes in Computer Science, 8558, 61-76.