The DOI matches its Crossref record; 113 of the 113 references it cites were found in a registry or an index.
Coherence as constraint satisfaction
Open accessAbstract
This paper provides a computational characterization of coherence that applies to a wide range of philosophical problems and psychological phenomena. Maximizing coherence is a matter of maximizing satisfaction of a set of positive and negative constraints. After comparing five algorithms for maximizing coherence, we show how our characterization of coherence overcomes traditional philosophical objections about circularity and truth.
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
Optimization by Simulated Annealing
Kirkpatrick, S., Gelatt, C. D., & Vecchi, M. P. (1983) · Science · doi:10.1126/science.220.4598.671 · Cited by 45,134
Neural networks and physical systems with emergent collective computational abilities.
Hopfield, J. J. (1982) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.79.8.2554 · Cited by 19,270
Stochastic relaxation, gibbs distributions, and the bayesian restoration of images.
Geman, S., & Geman, D. (1984) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.1984.4767596 · Cited by 17,949
A BEHAVIORAL MODEL OF RATIONAL CHOICE
Simon, H. A. (1955) · The Quarterly Journal of Economics · doi:10.2307/1884852 · Cited by 15,877
Parallel Distributed Processing: Explorations in the Microstructure of Cognition: Foundations
Rumelhart, D. E., McClelland, J. L., & AU (1986) · doi:10.7551/mitpress/5236.001.0001 · Cited by 15,686
A Theory of Justice: Original Edition
Rawls, J. (1971) · doi:10.4159/9780674042605 · Cited by 9,496
Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer
Shor, P. W. (1997) · SIAM Journal on Computing · doi:10.1137/s0097539795293172 · Cited by 8,472
Social Choice and Individual Values.
Shackle, G. L. S., & Arrow, K. J. (1951) · Economica · doi:10.2307/2549613 · Cited by 7,792
The complexity of theorem-proving procedures
Cook, S. A. (1971) · Proceedings of the third annual ACM symposium on Theory of computing - STOC '71 · doi:10.1145/800157.805047 · Cited by 6,385
“Neural” computation of decisions in optimization problems
Hopfield, J. J., & Tank, D. W. (1985) · Biological Cybernetics · doi:10.1007/bf00339943 · Cited by 6,031
Cited by
Keil, F. C. (2006) · Annual Review of Psychology · doi:10.1146/annurev.psych.57.102904.190100 · Cited by 1,350
Bridging emotion theory and neurobiology through dynamic systems modeling
Lewis, M. D. (2005) · Behavioral and Brain Sciences · doi:10.1017/s0140525x0500004x · Cited by 618
The formation of opportunity beliefs: overcoming ignorance and reducing doubt
Shepherd, D. A., McMullen, J. S., & Jennings, P. D. (2007) · Strategic Entrepreneurship Journal · doi:10.1002/sej.3 · Cited by 408
van Rooij, I., & Baggio, G. (2021) · Perspectives on Psychological Science · doi:10.1177/1745691620970604 · Cited by 354
The Tractable Cognition Thesis
Van Rooij, I. (2008) · Cognitive Science · doi:10.1080/03640210801897856 · Cited by 285
Metadata
- Authors
- Thagard, P.
- Venue
- Cognitive Science
- Publisher
- Wiley
- Published
- 1998-03
- Volume
- 22
- Issue
- 1
- Pages
- 1-24
- ISSN
- 0364-0213 (ISSN-L)
- OpenAlex
- W2115297031
- Cited by
- 352
- References
- 113
- FWCI
- 7.00
- Type
- journal article
- Language
- en
- Open access
- bronze
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: Coherence as constraint satisfaction. https://app.cochat.ai/papers/10.1016/s0364-0213(99)80033-0
- The paper
- Thagard, P. (1998). Coherence as constraint satisfaction. Cognitive Science. https://doi.org/10.1016/s0364-0213(99)80033-0
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.