The DOI matches its Crossref record; 13 of the 13 references it cites were found in a registry or an index.
Algorithms for Computing Minimal Unsatisfiable Subsets of Constraints
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
Reducibility among Combinatorial Problems
Karp, R. M. (1972) · Complexity of Computer Computations · doi:10.1007/978-1-4684-2001-2_9 · Cited by 11,511
A machine program for theorem-proving
Davis, M., Logemann, G., & Loveland, D. (1962) · Communications of the ACM · doi:10.1145/368273.368557 · Cited by 3,220
Complexity of Computer Computations
(1972) · Springer eBooks · doi:10.1007/978-1-4684-2001-2 · Cited by 2,781
A Computing Procedure for Quantification Theory
Davis, M., & Putnam, H. (1960) · Journal of the ACM · doi:10.1145/321033.321034 · Cited by 2,647
Eén, N., & Sörensson, N. (2004) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-24605-3_37 · Cited by 2,629
Alloy: a lightweight object modelling notation
Jackson, D. (2002) · ACM Transactions on Software Engineering and Methodology · doi:10.1145/505145.505149 · Cited by 1,181
A Fast Linear-Arithmetic Solver for DPLL(T)
Dutertre, B., & de Moura, L. (2006) · Lecture notes in computer science · doi:10.1007/11817963_11 · Cited by 679
Towards an Optimal CNF Encoding of Boolean Cardinality Constraints
Sinz, C. (2005) · Lecture Notes in Computer Science · doi:10.1007/11564751_73 · Cited by 469
Bryant, R. E., Lahiri, S. K., & Seshia, S. A. (2002) · Lecture Notes in Computer Science · doi:10.1007/3-540-45657-0_7 · Cited by 240
Verification of Proofs of Unsatisfiability for CNF Formulas
Goldberg, E. I., & Novikov, Y. (2003) · Cited by 143
Cited by
Satisfiability Modulo Theories
Barrett, C., & Tinelli, C. (2018) · Handbook of Model Checking · doi:10.1007/978-3-319-10575-8_11 · Cited by 1,122
Logic-based technologies for multi-agent systems: a systematic literature review
Calegari, R., Ciatto, G., Mascardi, V., & Omicini, A. (2021) · Autonomous Agents and Multi-Agent Systems · doi:10.1007/s10458-020-09478-3 · Cited by 117
“R [159], tuProlog [122], Xsb [309], YAP Prolog [93] No logic AGENTFLY [322], Aglets [221], CArtAgO [298], ConArg [38], cougaar [173], JaCaMo [41], JADE-JBossESB [346], JACKAL [92], Klaim [115], Magentix2 [328], MASON [238], Moise & S-Moise+ [193], Presage2 [71], RETSINA [329], SARL APL [302] Technology not found ABLE…”
Background
Metadata
- Authors
- Liffiton, M. H., & Sakallah, K. A.
- Venue
- Journal of Automated Reasoning
- Published
- 2007-09-13
- Volume
- 40
- Issue
- 1
- Pages
- 1-33
- ISSN
- 0168-7433 (ISSN-L)
- 1573-0670
- OpenAlex
- W2020169768
- Cited by
- 329
- References
- 13
- FWCI
- 16.27
- Type
- journal article
- 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: Algorithms for Computing Minimal Unsatisfiable Subsets of Constraints. https://app.cochat.ai/papers/10.1007/s10817-007-9084-z
- The paper
- Liffiton, M. H., & Sakallah, K. A. (2008). Algorithms for Computing Minimal Unsatisfiable Subsets of Constraints. Journal of Automated Reasoning. https://doi.org/10.1007/s10817-007-9084-z
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.
