Combining Proof-Producing Decision Procedures - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2007

Combining Proof-Producing Decision Procedures


Constraint solvers are key modules in many systems with reasoning capabilities (e.g., automated theorem provers). To incorporate constraint solvers in such systems, the capability of producing conflict sets or explanations of their results is crucial. For expressiveness, constraints are usually built out in unions of theories and constraint solvers in such unions are obtained by modularly combining solvers for the component theories. In this paper, we consider the problem of modularly constructing conflict sets for a combined theory by re-using available proof-producing procedures for the component theories. The key idea of our solution to this problem is the concept of explanation graph, which is a labelled, acyclic and undirected graph capable of recording the entailment of some equalities. Explanation graphs allow us to record explanations computed by a proof-producing procedure and to refine the Nelson-Oppen combination method to modularly build conflict sets for disjoint unions of theories. We also study how the computed conflict sets relate to an appropriate notion of minimality.

Dates and versions

inria-00187425 , version 1 (14-11-2007)



Silvio Ranise, Christophe Ringeissen, Duc-Khanh Tran. Combining Proof-Producing Decision Procedures. 6th International Symposium o Frontiers of Combining Systems - FroCoS 2007, Boris Konev and Frank Wolter, Sep 2007, Liverpool, United Kingdom. pp.237-251, ⟨10.1007/978-3-540-74621-8_16⟩. ⟨inria-00187425⟩
158 View
0 Download



Gmail Facebook Twitter LinkedIn More