Boolean Satisfiability

Boolean Satisfiability is a decision problem in computational logic that determines whether there exists a truth assignment to a finite set of Boolean variables that satisfies a given propositional logic formula expressed in conjunctive normal form.

1.8K

Publications

109.5K

Citations

2.9K

Authors

919

Institutions

Publications per year

2017–2026

314

Authors

2.9K

  1. JM
    João Marques‐Silva

    Instituto de Engenharia de Sistemas e Computadores Investigação e Desenvolvimento, Portugal

    50 publications · 3.5K citations

    27

    h-index

  2. KA
    Karem A. Sakallah

    University of Michigan, United States

    33 publications · 3.3K citations

    25

    h-index

  3. RD
    Rolf Drechsler

    University of Bremen, Germany

    43 publications · 1.7K citations

    24

    h-index

  4. SM
    Sharad Malik

    Princeton University, United States

    25 publications · 5.4K citations

    23

    h-index

  5. RW
    Robert Wille

    Johannes Kepler University of Linz, Austria

    21 publications · 1K citations

    19

    h-index

1–5 of 2.9K

Venues

  1. 25

    h-index

  2. Journal of Artificial Intelligence Research

    JAIR · 32 publications · 2.8K citations

    23

    h-index

  3. arXiv (Cornell University)

    Repository · 50 publications · 1.6K citations

    22

    h-index

  4. 21

    h-index

  5. Theoretical Computer Science

    29 publications · 1.4K citations

    20

    h-index

1–5