Propositional circumscription and extended closed-world reasoning are ΠP2-complete

Circumscription—A form of non-monotonic reasoning

John McCarthy · Artificial Intelligence · 1980 · 2K citations

Humanities, Psychology, Decision Theory +11

The Semantics of Predicate Logic as a Programming Language

M. H. van Emden, Robert Kowalski · Journal of the ACM · 1976 · 1.5K citations · Full text

Humanities, Computer Science, Logic +16

The NP-completeness column: An ongoing guide

David S. Johnson · Journal of Algorithms · 1986 · 803 citations

Computing, Computer Science, Algorithms +9

NP is as easy as detecting unique solutions

Leslie G. Valiant, Vijay V. Vazirani · Theoretical Computer Science · 1986 · 659 citations

Computing, Computer Science, Artificial Intelligence +4

The complexity of optimization problems

Mark W. Krentel · Journal of Computer and System Sciences · 1988 · 455 citations

Computing, Computer Science, Algorithms +8