Skip to Main content Skip to Navigation
Journal articles

Combination of Convex Theories: Modularity, Deduction Completeness, and Explanation

Duc-Khanh Tran 1 Christophe Ringeissen 2 Silvio Ranise 3 Hélène Kirchner 4
2 CASSIS - Combination of approaches to the security of infinite states systems
FEMTO-ST - Franche-Comté Électronique Mécanique, Thermique et Optique - Sciences et Technologies (UMR 6174), INRIA Lorraine, LORIA - Laboratoire Lorrain de Recherche en Informatique et ses Applications
Abstract : Decision procedures are key components of theorem provers and constraint satisfaction systems. Their modular combination is of prime interest for building efficient systems, but their effective use is often limited by poor interface capabilities, when such procedures only provide a simple “sat/unsat” answer. In this paper, we develop a framework to design cooperation schemas between such procedures while maintaining modularity of their interfaces. First, we use the framework to specify and prove the correctness of classic combination schemas by Nelson–Oppen and Shostak. Second, we introduce the concept of deduction complete satisfiability procedures, we show how to build them for large classes of theories, then we provide a schema to modularly combine them. Third, we consider the problem of modularly constructing explanations for combinations by re-using available proof-producing procedures for the component theories.
Document type :
Journal articles
Complete list of metadatas
Contributor : Christophe Ringeissen <>
Submitted on : Thursday, October 29, 2009 - 11:28:23 AM
Last modification on : Wednesday, September 16, 2020 - 10:43:02 AM

Links full text



Duc-Khanh Tran, Christophe Ringeissen, Silvio Ranise, Hélène Kirchner. Combination of Convex Theories: Modularity, Deduction Completeness, and Explanation. Journal of Symbolic Computation, Elsevier, 2010, Automated Deduction: Decidability, Complexity, Tractability, 45 (2), pp.261-286. ⟨10.1016/j.jsc.2008.10.006⟩. ⟨inria-00428583⟩



Record views