Boolean Constraint Satisfaction

Boolean Constraint Satisfaction is a constraint satisfaction problem in which the domain of each variable is restricted to Boolean values, and the constraints are expressed as logical relations over these variables.

171

Publications

7.7K

Citations

324

Authors

183

Institutions

Publications per year

2017–2026

21

Authors

324

  1. MM
    Michael Molloy

    University of Toronto, Canada

    9 publications · 204 citations

    9

    h-index

  2. TS
    Torsten Schaub

    University of Potsdam, Germany

    4 publications · 174 citations

    4

    h-index

  3. KA
    Karem A. Sakallah

    University of Michigan, United States

    4 publications · 241 citations

    4

    h-index

  4. RA
    Rob A. Rutenbar

    Carnegie Mellon University, United States

    4 publications · 241 citations

    4

    h-index

  5. AK
    Andrei Krokhin

    Durham University, United Kingdom

    4 publications · 129 citations

    4

    h-index

1–5 of 324

Venues

  1. Artificial Intelligence

    6 publications · 588 citations

    6

    h-index

  2. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)

    Repository · 5 publications · 81 citations

    5

    h-index

  3. Theoretical Computer Science

    5 publications · 124 citations

    5

    h-index

  4. SIAM Journal on Computing

    6 publications · 407 citations

    5

    h-index

  5. arXiv (Cornell University)

    Repository · 5 publications · 69 citations

    5

    h-index

1–5