Audemard, Gilles and Bertoli, Piergiorgio and Cimatti, Alessandro and Kornilowicz, Artur and Sebastiani, Roberto (2003) Efficiently Integrating Boolean Reasoning and Mathematical Solving. UNSPECIFIED. (Unpublished)
Many real-world problems require the ability of reasoning efficiently on formulae which are boolean combinations of boolean and unquantified mathematical propositions. This task requires a fruitful combination of efficient boolean reasoning and mathematical solving capabilities. SAT tools and mathematical reasoners are respectively very effective on one of these activities each, but not on both. In this paper we present a formal framework, a generalized algorithm and architecture for integrating boolean reasoners and mathematical solvers so that they can efficiently solve boolean combinations of boolean and unquantified mathematical propositions. We describe many techniques to optimize this integration, and highlight the main requirements for SAT tools and mathematicalsolvers to maximize the benefits of their integration.
Actions (login required)