The DOI matches its Crossref record; 8 of the 8 references it cites were found in a registry or an index.
On selecting a satisfying truth assignment
Abstract
The complexity of certain natural generalizations of satisfiability, in which one of the possibly exponentially many satisfying truth assignments must be selected, is studied. Two natural selection criteria, default preference and minimality (circumscription), are considered. The thrust of the complexity results seems to be that hard problems become harder, while easy problems remain easy. This consideration yields as a byproduct a new and very natural polynomial-time randomized algorithm for 2SAT.>
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Circumscription—A form of non-monotonic reasoning
McCarthy, J. (1980) · Artificial Intelligence · doi:10.1016/0004-3702(80)90011-9 · Cited by 2,017
Circumscription—A Form of Non-Monotonic Reasoning
McCarthy, J. (1981) · Readings in Artificial Intelligence · doi:10.1016/b978-0-934613-03-3.50036-2 · Cited by 228
Making believers out of computers
Levesque, H. J. (1986) · Artificial Intelligence · doi:10.1016/0004-3702(86)90068-8 · Cited by 228
The mixing rate of Markov chains, an isoperimetric inequality, and computing the volume
Lovasz, L., & Simonovits, M. (2002) · Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science · doi:10.1109/fscs.1990.89553 · Cited by 190
Conductance and convergence of Markov chains-a combinatorial treatment of expanders
Mihail, M. (1989) · 30th Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.1989.63529 · Cited by 175
On the complexity of unique solutions
Papadimitriou, C. H. (1984) · Journal of the ACM · doi:10.1145/62.322435 · Cited by 98
Self-citationModel-preference default theories
Selman, B., & Kautz, H. (1990) · Artificial Intelligence · doi:10.1016/0004-3702(90)90010-w · Cited by 56
Some computational aspects of circumscription
Kolaitis, P. G., & Papadimitriou, C. H. (1990) · Journal of the ACM · doi:10.1145/78935.78936 · Cited by 54
Self-citation
Cited by
Handbook of Constraint Programming
(2006) · Foundations of Artificial Intelligence · doi:10.1016/s1574-6526(06)x8001-x · Cited by 1,483
Handbook of Knowledge Representation
(2008) · Foundations of Artificial Intelligence · doi:10.1016/s1574-6526(07)x0300-6 · Cited by 883
Exact Algorithms for NP-Hard Problems: A Survey
Woeginger, G. J. (2003) · Lecture Notes in Computer Science · doi:10.1007/3-540-36478-1_17 · Cited by 652
Ambainis, A., Bach, E., Nayak, A., Vishwanath, A., & Watrous, J. (2001) · Proceedings of the thirty-third annual ACM symposium on Theory of computing · doi:10.1145/380752.380757 · Cited by 562
A probabilistic algorithm for k-SAT and constraint satisfaction problems
Schoning, T. (2003) · 40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039) · doi:10.1109/sffcs.1999.814612 · Cited by 433
Metadata
- Authors
- Papadimitriou, C. H.
- Venue
- [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science
- Publisher
- IEEE Comput. Soc. Press
- Published
- 2002-12-09
- Pages
- 163-169
- OpenAlex
- W1820801893
- Cited by
- 266
- References
- 8
- FWCI
- 11.09
- Type
- conference paper
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: On selecting a satisfying truth assignment. https://app.cochat.ai/papers/10.1109/sfcs.1991.185365
- The paper
- Papadimitriou, C. H. (2002). On selecting a satisfying truth assignment. [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science. https://doi.org/10.1109/sfcs.1991.185365
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.