Satisfiability modulo theories and assignments

DOI10.1007/978-3-319-63046-5_4zbMath1468.68193OpenAlexW2729127299MaRDI QIDQ2405239

Stéphane Graham-Lengrand, Natarajan Shankar, Maria Paola Bonacina

Publication date: 22 September 2017

Full work available at URL: https://doi.org/10.1007/978-3-319-63046-5_4

zbMATH Keywords

model buildingtheory combinationsatisfiability modulo assignmentconflict-driven decision procedures

Mathematics Subject Classification ID

Logic in computer science (03B70) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items (6)

Unifying splitting ⋮ A conflict-driven solving procedure for poly-power constraints ⋮ Conflict-driven satisfiability for theory combination: transition system and completeness ⋮ A unifying splitting framework ⋮ Solving bitvectors with MCSAT: explanations from bits and pieces ⋮ SAT-Inspired Eliminations for Superposition

This page was built for publication: Satisfiability modulo theories and assignments