NP-completeness of small conflict set generation for congruence closure

Abstract : The efficiency of Satisfiability Modulo Theories (SMT) solvers is dependent on the capability of theory reasoners to provide small conflict sets, i.e. small unsatisfiable subsets from unsatisfiable sets of literals. Decision procedures for uninterpreted symbols (i.e. congruence closure algorithms) date back from the very early days of SMT. Nevertheless, to the best of our knowledge , the complexity of generating smallest conflict sets for sets of literals with uninterpreted symbols and equalities had not yet been determined, although the corresponding decision problem was believed to be NP-complete. We provide here an NP-completeness proof, using a simple reduction from SAT.
Document type :
Journal articles
Liste complète des métadonnées
Contributor : Pascal Fontaine <>
Submitted on : Tuesday, October 30, 2018 - 2:20:49 PM
Last modification on : Tuesday, February 19, 2019 - 3:40:04 PM


Files produced by the author(s)



Andreas Fellner, Pascal Fontaine, Bruno Woltzenlogel Paleo. NP-completeness of small conflict set generation for congruence closure. Formal Methods in System Design, Springer Verlag, 2017, 51 (3), pp.533 - 544. ⟨10.1007/s10703-017-0283-x⟩. ⟨hal-01908684⟩



Record views


Files downloads