Satisfiability
Satisfiability is the property of a propositional formula whereby there exists at least one truth assignment to its variables that makes the formula evaluate to true.
2.1K
Publications
120.8K
Citations
3.1K
Authors
980
Institutions
Publications per year
2017–2026
362
Parents
2.1K
The complexity of satisfiability problems
Thomas J. Schaefer · 1978 · 1.8K citations · Full text
Proof verification and the hardness of approximation problems
Sanjeev Arora, Carsten Lund, Rajeev Motwani et al. · Journal of the ACM · 1998 · 1.4K citations · Full text
A new method for solving hard satisfiability problems
Bart Selman, Hector J. Levesque, David G. M. Mitchell · 1992 · 1.2K citations
1–5 of 2.1K
3.1K
Instituto de Engenharia de Sistemas e Computadores Investigação e Desenvolvimento, Portugal
53 publications · 3.5K citations
29
h-index
24
h-index
23
h-index
21
h-index
19
h-index
1–5 of 3.1K
980

Centre National de la Recherche Scientifique
Paris, France
36 h-index
161 publications
11.7K citations
University of California, Berkeley
Berkeley, United States
34 h-index
133 publications
12.3K citations

University of Toronto
Toronto, Canada
30 h-index
88 publications
7.2K citations
Princeton University
Princeton, United States
28 h-index
99 publications
9K citations
Instituto de Engenharia de Sistemas e Computadores Investigação e Desenvolvimento
Lisbon, Portugal
26 h-index
73 publications
4.6K citations
Carnegie Mellon University
Pittsburgh, United States
26 h-index
67 publications
3.6K citations
University of Michigan
Ann Arbor, United States
25 h-index
90 publications
6.3K citations
University of Bremen
Bremen, Germany
25 h-index
152 publications
5.7K citations
1–8 of 980
39 publications · 3.1K citations
25
h-index
Repository · 63 publications · 2K citations
24
h-index
JAIR · 33 publications · 1.7K citations
23
h-index
Conference · 43 publications · 1.7K citations
23
h-index
25 publications · 2.3K citations
22
h-index
1–5