Conjunctive Normal Form is a canonical representation of a propositional logic formula expressed as a conjunction of clauses, each of which is a disjunction of literals.
204
Publications
11.7K
Citations
398
Authors
204
Institutions
Publications per year
2017–2026
25
Parents
Publications
204
The complexity of satisfiability problems
Thomas J. Schaefer · 1978 · 1.8K citations · Full text
Extending and implementing the stable model semantics
Patrik Simons, Ilkka Niemelä, Timo Soininen · Artificial Intelligence · 2002 · 850 citations
Recent Advances in AI Planning
Daniel S. Weld · 1999 · 428 citations
1–5 of 204
Authors
398
- MS
7
h-index
- AB
6
h-index
- FL
5
h-index
- DW
4
h-index
- LS
4
h-index
1–5 of 398
Institutions
204
Johannes Kepler University of Linz
Linz, Austria
8 h-index
17 publications
880 citations
Massachusetts Institute of Technology
Cambridge, United States
7 h-index
9 publications
734 citations
Rutgers, The State University of New Jersey
New Brunswick, United States
6 h-index
8 publications
900 citations
University of Toronto
Toronto, Canada
5 h-index
5 publications
107 citations
University of California San Diego
San Diego, United States
5 h-index
12 publications
831 citations
Carnegie Mellon University
Pittsburgh, United States
5 h-index
6 publications
311 citations
University of Bremen
Bremen, Germany
4 h-index
9 publications
359 citations
University of Michigan
Ann Arbor, United States
4 h-index
13 publications
1K citations
1–8 of 204
Venues
- SIAM Journal on Computing
10 publications · 620 citations
10
h-index
- arXiv (Cornell University)
Repository · 7 publications · 197 citations
7
h-index
- IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
6 publications · 184 citations
6
h-index
- Proceedings of the AAAI Conference on Artificial Intelligence
Conference · 5 publications · 91 citations
5
h-index
- Discrete Applied Mathematics
4 publications · 184 citations
4
h-index
1–5