Dpll(t)
DPLL(T) is a formal decision procedure for satisfiability modulo theories that extends the DPLL algorithm for propositional satisfiability by integrating a background theory solver to handle theory-specific constraints.
20
Publications
1.5K
Citations
45
Authors
25
Institutions
Publications per year
2017–2026
0
20
Solving SAT and SAT Modulo Theories
Robert Nieuwenhuis, Albert Oliveras, Cesare Tinelli · Journal of the ACM · 2006 · 777 citations
RSat 2.0: SAT Solver Description
Knot Pipatsrisawat, Adnan Darwiche · 2006 · 94 citations
1–5 of 20
45
4
h-index
2
h-index
2
h-index
2
h-index
2
h-index
1–5 of 45
25
University of Iowa
Iowa City, United States
4 h-index
6 publications
998 citations
New York University
New York, United States
2 h-index
5 publications
84 citations
Princeton University
Princeton, United States
2 h-index
4 publications
48 citations
Verimag
Gières, France
2 h-index
4 publications
68 citations

Université Joseph Fourier
Grenoble, France
2 h-index
4 publications
68 citations

Centre National de la Recherche Scientifique
Paris, France
2 h-index
2 publications
34 citations
Institut polytechnique de Grenoble
Grenoble, France
2 h-index
2 publications
34 citations
Universitat Politècnica de Catalunya
Barcelona, Spain
2 h-index
6 publications
1.6K citations
1–8 of 25
3 publications · 174 citations
3
h-index
1 publications · 43 citations
1
h-index
Conference · 1 publications · 23 citations
1
h-index
JACM · 1 publications · 777 citations
1
h-index
IJAIT · 1 publications · 65 citations
1
h-index
1–5