Boolean Satisfiability Modulo Theories
Boolean Satisfiability Modulo Theories is a formal decision problem that extends the Boolean satisfiability problem by incorporating background theories from specific domains, enabling the verification of logical formulas over Boolean variables combined with domain-specific constraints expressed in decidable first-order theories.
248
Publications
10.9K
Citations
562
Authors
249
Institutions
Publications per year
2017–2026
102
Parents
248
Solving SAT and SAT Modulo Theories
Robert Nieuwenhuis, Albert Oliveras, Cesare Tinelli · Journal of the ACM · 2006 · 777 citations
Satisfiability modulo theories
Leonardo de Moura, Nikolaj Bjørner · Communications of the ACM · 2011 · 629 citations
Bruno Dutertre, Leonardo de Moura · 2006 · 483 citations
Oracle-guided component-based program synthesis
Susmit Jha, Sumit Gulwani, Sanjit A. Seshia et al. · 2010 · 479 citations
1–5 of 248
562
10
h-index
10
h-index
9
h-index
9
h-index
9
h-index
1–5 of 562
249
University of California, Berkeley
Berkeley, United States
12 h-index
35 publications
2.1K citations
Microsoft (United States)
Redmond, United States
11 h-index
23 publications
2.8K citations

University of Trento
Trento, Italy
10 h-index
16 publications
826 citations
Microsoft Research (United Kingdom)
Cambridge, United Kingdom
9 h-index
22 publications
1K citations

Universitat de Girona
Girona, Spain
9 h-index
28 publications
625 citations

Centre National de la Recherche Scientifique
Paris, France
7 h-index
7 publications
675 citations
University of California, Los Angeles
Los Angeles, United States
7 h-index
14 publications
916 citations
University of Iowa
Iowa City, United States
6 h-index
9 publications
1.1K citations
1–8 of 249
Conference · 10 publications · 246 citations
10
h-index
Repository · 9 publications · 483 citations
9
h-index
8 publications · 530 citations
8
h-index
ENTCS · 5 publications · 102 citations
5
h-index
3 publications · 89 citations
3
h-index
1–5