Satisfiability Modulo Theories and Assignments - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2017

Satisfiability Modulo Theories and Assignments

Résumé

The CDCL procedure for SAT is the archetype of conflict-driven procedures for satisfiability of quantifier-free problems in a single theory. In this paper we lift CDCL to CDSAT (Conflict-Driven Satisfia-bility), a system for conflict-driven reasoning in combinations of disjoint theories. CDSAT combines theory modules that interact through a global trail representing a candidate model by Boolean and first-order assignments. CDSAT generalizes to generic theory combinations the model-constructing satisfiability calculus (MCSAT) introduced by de Moura and Jovanovi´cJovanovi´c. Furthermore, CDSAT generalizes the equality sharing (Nelson-Oppen) approach to theory combination, by allowing theories to share equality information both explicitly through equalities and dis-equalities, and implicitly through assignments. We identify sufficient conditions for the soundness, completeness, and termination of CDSAT.
Fichier principal
Vignette du fichier
CDSATpaper.pdf (527.11 Ko) Télécharger le fichier
Origine Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-01615830 , version 1 (12-10-2017)

Identifiants

Citer

Maria Paola Bonacina, Stéphane Graham-Lengrand, Natarajan Shankar. Satisfiability Modulo Theories and Assignments. CADE 2017 - 26th International Conference on Automated Deduction, Aug 2017, Gothenburg, Sweden. ⟨10.1007/978-3-319-63046-5_4⟩. ⟨hal-01615830⟩
367 Consultations
224 Téléchargements

Altmetric

Partager

Gmail Mastodon Facebook X LinkedIn More