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

Authors

562

  1. SA
    Sanjit A. Seshia

    University of California, Berkeley, United States

    10 publications · 784 citations

    10

    h-index

  2. AC
    Alessandro Cimatti

    Fondazione Bruno Kessler, Italy

    10 publications · 306 citations

    10

    h-index

  3. YS
    Yasser Shoukry

    University of California, Los Angeles, United States

    9 publications · 424 citations

    9

    h-index

  4. PT
    Paulo Tabuada

    University of California, Los Angeles, United States

    9 publications · 424 citations

    9

    h-index

  5. MB
    Miquel Bofill

    Universitat de Girona, Spain

    9 publications · 194 citations

    9

    h-index

1–5 of 562

Venues

  1. Proceedings of the AAAI Conference on Artificial Intelligence

    Conference · 10 publications · 246 citations

    10

    h-index

  2. arXiv (Cornell University)

    Repository · 9 publications · 483 citations

    9

    h-index

  3. 8

    h-index

  4. Electronic Notes in Theoretical Computer Science

    ENTCS · 5 publications · 102 citations

    5

    h-index

  5. 3

    h-index

1–5