The Community for Technology Leaders
2011 13th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (2009)
Timisoara, Romania
Sept. 26, 2009 to Sept. 29, 2009
ISBN: 978-0-7695-3964-5
pp: 16
ABSTRACT
We give a simple introduction to satisfiability modulo theories intended fornon-specialists. No previous background is assumed.
INDEX TERMS
propositional logic, satisfiability, theory combination, decision procedures, satisfiability modulo theory
CITATION
Andrei Voronkov, "Satisfiability and Theories", 2011 13th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, vol. 00, no. , pp. 16, 2009, doi:10.1109/SYNASC.2009.65
89 ms
(Ver 3.3 (11022016))