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

Authors

45

  1. CT
    Cesare Tinelli

    University of Iowa, United States

    4 publications · 909 citations

    4

    h-index

  2. LD
    Leonardo de Moura

    Microsoft (United States), United States

    2 publications · 136 citations

    2

    h-index

  3. RN
    Robert Nieuwenhuis

    Universitat Politècnica de Catalunya, Spain

    2 publications · 796 citations

    2

    h-index

  4. PB
    Peter Baumgartner

    University of Koblenz and Landau, Germany

    2 publications · 108 citations

    2

    h-index

  5. FB
    Fahiem Bacchus

    University of Toronto, Canada

    2 publications · 41 citations

    2

    h-index

1–5 of 45

Venues

  1. Journal of Automated Reasoning

    3 publications · 174 citations

    3

    h-index

  2. Artificial Intelligence

    1 publications · 43 citations

    1

    h-index

  3. National Conference on Artificial Intelligence

    Conference · 1 publications · 23 citations

    1

    h-index

  4. Journal of the ACM

    JACM · 1 publications · 777 citations

    1

    h-index

  5. International Journal of Artificial Intelligence Tools

    IJAIT · 1 publications · 65 citations

    1

    h-index

1–5