From Propositional Satisfiability to Satisfiability Modulo Theories

DOI10.1007/11814948_1zbMath1187.68567OpenAlexW1512621320MaRDI QIDQ5756564

Hossein M. Sheini, Karem A. Sakallah

Publication date: 4 September 2007

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11814948_1

Mathematics Subject Classification ID

Decidability of theories and sets of sentences (03B25) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items (4)

Optimal rectangle packing ⋮ Solving constraint satisfaction problems with SAT modulo theories ⋮ Channel-based coordination via constraint satisfaction ⋮ Deconstructing <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si1.gif" overflow="scroll"><mml:mi mathvariant="script">R</mml:mi><mml:mi mathvariant="sans-serif">eo</mml:mi></mml:math>

This page was built for publication: From Propositional Satisfiability to Satisfiability Modulo Theories