The DOI matches its Crossref record; 10 of the 12 references it cites were found in a registry or an index.
Circumscription—A form of non-monotonic reasoning
Overview
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
In the citing paper
“It turned out to be too dif fi cult to specify all the relevant rules for a given situation (McCarthy 1980), and the legal domain was no exception (Leith 2016).”
From Human Judgment in algorithmic loops: Individual justice and automated decision‐making (2022) · cites this paper as McCarthy 1980
In the citing paper
“However, legal expert systems, like expert systems in general, did not transpire to be as effective as hoped.”
From Human Judgment in algorithmic loops: Individual justice and automated decision‐making (2022) · cites this paper as McCarthy 1980
Citations
Cites
Reiter, R. (1980) · Artificial Intelligence · doi:10.1016/0004-3702(80)90014-4 · Cited by 3,926
Some Philosophical Problems from the Standpoint of Artificial Intelligence
McCarthy, J., & Hayes, P. J. (1981) · Elsevier eBooks · doi:10.1016/b978-0-934613-03-3.50033-7 · Cited by 3,296
Self-citationMcDermott, D., & Doyle, J. (1980) · Artificial Intelligence · doi:10.1016/0004-3702(80)90012-0 · Cited by 912
McCarthy, J. (1960) · Cited by 799
Self-citationEPISTEMOLOGICAL PROBLEMS OF ARTIFICIAL INTELLIGENCE
McCarthy, J. (1981) · Elsevier eBooks · doi:10.1016/b978-0-934613-03-3.50035-0 · Cited by 327
Self-citationHewitt, C. E. (1972) · Defense Technical Information Center (DTIC) · Cited by 316
On Representations of Problems of Reasoning about Actions
Amarel, S. (1981) · Elsevier eBooks · doi:10.1016/b978-0-934613-03-3.50006-4 · Cited by 264
Ascribing Mental Qualities to MachinesPreprint
McCarthy, J. (1979) · CogPrints (University of Southampton) · Cited by 239
Self-citationPhilosophical Perspectives in Artificial Intelligence
Ringle (1980) · Cited by 202
First Order Theories of Individual Concepts and Propositions.Preprint
McCarthy, J. (1979) · CogPrints (University of Southampton) · Cited by 180
Self-citation
Cited by
Sorted by citations
Items 401–500 of 1,000
Dynamic reasoning with qualified syllogisms
Schwartz, D. G. (1997) · Artificial Intelligence · doi:10.1016/s0004-3702(97)00020-9 · Cited by 40
A computational theory of belief introspection
Konolige, K. (1985) · International Joint Conference on Artificial Intelligence · Cited by 40
Reducing Disjunctive to Non-Disjunctive Semantics by Shift-Operations
Dix, J., Gottlob, G., & Marek, W. (1996) · Fundamenta Informaticae · doi:10.3233/fi-1996-281205 · Cited by 40
A model-based approach to updating databases with incomplete information
Winslett, M. (1988) · ACM Transactions on Database Systems · doi:10.1145/42338.42386 · Cited by 40
Nonmonotonicity and the scope of reasoning
Etherington, D. W., Kraus, S., & Perlis, D. R. (1991) · Artificial Intelligence · doi:10.1016/0004-3702(91)90068-u · Cited by 40
Tableau-based characterization and theorem proving for default logic
Risch, V., & Schwind, C. B. (1994) · Journal of Automated Reasoning · doi:10.1007/bf00881957 · Cited by 40
Extending Domain Theories: Two Case Studies in Student Modeling
Sleeman, D. H., Hirsh, H., Ellery, I., & Kim, I.-Y. (1990) · Machine Learning · doi:10.1023/a:1022607624441 · Cited by 40
The anomalous extension problem in default reasoning
Morris, P. H. (1988) · Artificial Intelligence · doi:10.1016/0004-3702(88)90022-7 · Cited by 40
Artificial Intelligence, Logic, and Formalising Common Sense
McCarthy, J. (2022) · doi:10.1002/9781119815075.ch6 · Cited by 40
Self-citationMueller, E. T. (2014) · Elsevier eBooks · doi:10.1016/b978-0-12-801416-5.00002-4 · Cited by 39
Circumscriptive event calculus as answer set programming
Kim, T., Lee, J., & Palla, R. (2009) · Cited by 39
On the consistency of rule bases based on lattice-valued first-order logic LF(X)
Xu, Y., Liu, J., Ruan, D., & Lee, T. (2006) · International Journal of Intelligent Systems · doi:10.1002/int.20129 · Cited by 39
González, C., Ben‐Asher, N., Oltramari, A., & Lebiere, C. J. (2014) · Advances in information security · doi:10.1007/978-3-319-11391-3_6 · Cited by 39
Space Efficiency of Propositional Knowledge Representation Formalisms
Cadoli, M., Donini, F. M., Liberatore, P., & Schaerf, M. (2000) · Journal of Artificial Intelligence Research · doi:10.1613/jair.664 · Cited by 39
A theorem prover for prioritized circumscription
Baker, A. B., & Ginsberg, M. L. (1989) · Cited by 39
Tomiyama, T. (1991) · Springer eBooks · doi:10.1007/978-3-642-76286-4_9 · Cited by 39
Bell, J. (1990) · Artificial Intelligence · doi:10.1016/0004-3702(90)90048-5 · Cited by 39
Papini, O. (2000) · The Knowledge Engineering Review · doi:10.1017/s026988890000401x · Cited by 38
Formal Approach to Integrating Feature and Architecture Models
Janota, M., & Botterweck, G. (2008) · Springer eBooks · doi:10.1007/978-3-540-78743-3_3 · Cited by 38
Combining UML and ontology: An exploratory survey
Mkhinini, M. M., Labbani, O., & Nicolle, C. (2020) · Computer Science Review · doi:10.1016/j.cosrev.2019.100223 · Cited by 38
Two Logical Theories of Plan Recognition
Wobcke, W. (2002) · Journal of Logic and Computation · doi:10.1093/logcom/12.3.371 · Cited by 37
A General Approach to Specificity in Default Reasoning
Delgrande, J. P., & Schaub, T. H. (1994) · Principles of Knowledge Representation and Reasoning · doi:10.1016/b978-1-4832-1452-8.50110-x · Cited by 38
Logic-Based Knowledge Representation
Baader, F. (1999) · Lecture notes in computer science · doi:10.1007/3-540-48317-9_2 · Cited by 38
The Role of Logic in Knowledge Representation
Israel, I. (1983) · Computer · doi:10.1109/mc.1983.1654195 · Cited by 38
Positivism vs minimalism in deductive databases
Bidoít, N., & Hull, R. B. (1985) · ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (PODS) · doi:10.1145/6012.15409 · Cited by 38
Stable Theories in Autoepistemic Logic
Marek, W. (1989) · Fundamenta Informaticae · doi:10.3233/fi-1989-12209 · Cited by 38
Guest Editorial: Argumentation in Multi-Agent Systems
Rahwan, I. (2005) · Autonomous Agents and Multi-Agent Systems · doi:10.1007/s10458-005-3079-0 · Cited by 38
Thielscher, M. (2010) · Artificial Intelligence · doi:10.1016/j.artint.2010.04.010 · Cited by 37
On first-order conditional logics
Delgrande, J. P. (1998) · Artificial Intelligence · doi:10.1016/s0004-3702(98)00088-5 · Cited by 37
The Distributed Ontology, Model and Specification Language – DOL
Mossakowski, T. (2017) · Lecture notes in computer science · doi:10.1007/978-3-319-72044-9_2 · Cited by 37
Øhrstrøm, P., Andersen, J. R., & Schärfe, H. (2005) · Lecture notes in computer science · doi:10.1007/11524564_29 · Cited by 37
Translations of network languages
Stilman, B. (1994) · Computers & Mathematics with Applications · doi:10.1016/0898-1221(94)90037-x · Cited by 37
Two counterexamples related to Baker's approach to the frame problem
Kartha, G. N. (1994) · Artificial Intelligence · doi:10.1016/0004-3702(94)90089-2 · Cited by 37
Disjunctive Logic Programming: A Survey and Assessment
Minker, J., & Seipel, D. A. (2002) · Lecture notes in computer science · doi:10.1007/3-540-45628-7_18 · Cited by 37
The interaction with incomplete knowledge bases: a formal treatment
Levesque, H. J. (1981) · Cited by 37
Rounds, W. C. (1997) · Handbook of Logic and Language · doi:10.1016/b978-044481714-3/50012-6 · Cited by 36
A case study on the Tower of Hanoi challenge: Representation, reasoning and execution
Havur, G., Haspalamutgil, K., Palaz, C., Erdem, E., & Patoğlu, V. (2013) · Proceedings - IEEE International Conference on Robotics and Automation/Proceedings · doi:10.1109/icra.2013.6631224 · Cited by 36
Logical dynamics meets logical pluralism?
van Benthem, J. (2008) · The Australasian Journal of Logic · doi:10.26686/ajl.v6i0.1801 · Cited by 36
4. Reasoning with Partial Knowledge
Polós, L., & Hannan, M. T. (2002) · Sociological Methodology · doi:10.1111/1467-9531.00114 · Cited by 36
Evaluation of an Algorithm for the Transversal Hypergraph Problem
Kavvadias, D. J., & Stavropoulos, E. C. (1999) · Lecture notes in computer science · doi:10.1007/3-540-48318-7_8 · Cited by 36
Przymusinska, H., & Przymusiński, T. C. (1994) · Fundamenta Informaticae · doi:10.3233/fi-1994-21124 · Cited by 36
The Feasibility of Defeat in Defeasible Reasoning
Vreeswijk, G. A. W. (1993) · Springer eBooks · doi:10.1007/978-94-015-8242-1_13 · Cited by 36
Decidability and definability with circumscription
Schlipf, J. S. (1987) · Annals of Pure and Applied Logic · doi:10.1016/0168-0072(87)90062-5 · Cited by 36
Konolige, K. (1982) · Cited by 36
Rocchini, D., Bhatt, M., & Wallgruen, J. O. (2016) · Cited by 35
The economics of AI adoption in OTAs: Market dynamics and future research
Hernández-Tamurejo, Á., González-Padilla, P., & Saiz-Sepúlveda, Á. (2025) · Global Economics Research · doi:10.1016/j.ecores.2025.100001 · Cited by 35
Philosophers are Mortal: Inferring the Truth of Unseen Facts
Angeli, G., & Manning, C. D. (2013) · Cited by 36
Burnay, C., Jureta, I., & Faulkner, S. (2014) · Information Systems · doi:10.1016/j.is.2014.05.006 · Cited by 41
Rational and mechanistic perspectives on reinforcement learning
Chater, N. (2008) · Cognition · doi:10.1016/j.cognition.2008.06.014 · Cited by 38
Functional answer set programming
Cabalar, P. (2011) · Theory and Practice of Logic Programming · doi:10.1017/s1471068410000517 · Cited by 35
Introducing Defeasibility into OWL Ontologies
Casini, G., Meyer, T. A., Moodley, K., Sattler, U., & Varzinczak, I. J. ́. (2015) · Lecture notes in computer science · doi:10.1007/978-3-319-25010-6_27 · Cited by 35
Logic and Complexity in Cognitive Science
Isaac, A., Szymanik, J., & Verbrugge, R. (2014) · Outstanding contributions to logic · doi:10.1007/978-3-319-06025-5_30 · Cited by 35
An improved factor based approach to precedential constraint
Rigoni, A. (2015) · Artificial Intelligence and Law · doi:10.1007/s10506-015-9166-x · Cited by 35
The complexity of belief update
Liberatore, P. (2000) · Artificial Intelligence · doi:10.1016/s0004-3702(00)00016-3 · Cited by 35
Minimal predicates, fixed-points, and definability
van Benthem, J. (2005) · Journal of Symbolic Logic · doi:10.2178/jsl/1122038910 · Cited by 35
'Classical' Negation in Nonmonotonic Reasoning and Logic Programming
Alferes, J. J., Pereira, L. M., & Przymusiński, T. C. (1998) · Journal of Automated Reasoning · doi:10.1023/a:1005900924623 · Cited by 35
Semantics of disjunctive deductive databases
Fernández, J. A., & Minker, J. (1992) · Lecture notes in computer science · doi:10.1007/3-540-56039-4_31 · Cited by 35
Sometimes updates are circumscription
Winslett, M. (1989) · International Joint Conference on Artificial Intelligence · Cited by 35
Predicate-calculus-based logics for modeling and solving search problems
East, D., & Truszczyński, M. (2006) · ACM Transactions on Computational Logic · doi:10.1145/1119439.1119441 · Cited by 34
Formalizing interactive staged feature model configuration
Ebrahim Bagheri, A., Noia, T. D., Gašević, D., & Ragone, A. (2011) · Journal of Software Evolution and Process · doi:10.1002/smr.534 · Cited by 34
Context and Relevance: A Pragmatic Approach
Ekbia, H. R., & Maguitman, A. G. (2001) · Lecture notes in computer science · doi:10.1007/3-540-44607-9_12 · Cited by 34
Abducing qualitative spatio-temporal histories from partial observations
Hazarika, S. M., & Cohn, A. G. (2002) · Cited by 34
Probability and Conditionals: Belief Revision and Rational Decision
Halpern, J. Y. (2000) · The Philosophical Review · doi:10.1215/00318108-109-2-277 · Cited by 34
Approximate reasoning: Past, present, future
Ruspini, E. H. (1991) · Information Sciences · doi:10.1016/0020-0255(91)90084-8 · Cited by 34
Model Minimization — An Alternative to Circumscription
Hintikka, J. (1998) · Springer eBooks · doi:10.1007/978-94-017-2045-8_11 · Cited by 34
Hewitt, C. E., & de Jong, P. (1984) · Topics in information systems · doi:10.1007/978-1-4612-5196-5_6 · Cited by 34
Default reasoning as likelihood reasoning
Rich, E. A. (1983) · Cited by 34
Stable models and their computation for logic programming with inheritance and true negation
Buccafurri, F., Leone, N., & Rullo, P. (1996) · The Journal of Logic Programming · doi:10.1016/0743-1066(95)00076-3 · Cited by 34
SOME REPRESENTATIONAL ISSUES IN DEFAULT REASONING
Reiter, R., & Criscuolo, G. (1983) · Elsevier eBooks · doi:10.1016/b978-0-08-030253-9.50007-x · Cited by 34
Knowledge systems: Principles and practice
Walker, A. (1986) · IBM Journal of Research and Development · doi:10.1147/rd.301.0002 · Cited by 34
Brass, S., Dix, J., & Przymusiński, T. C. (2004) · ACM Transactions on Computational Logic · doi:10.1145/963927.963931 · Cited by 34
Symbol-Processing Theories and the SOAR Architecture
Lindsay, R. (1991) · Psychological Science · doi:10.1111/j.1467-9280.1991.tb00155.x · Cited by 34
Global ontology research progress: a bibliometric analysis
Zhu, Q., Kong, X., Hong, S., Li, J., & He, Z. (2015) · Aslib Journal of Information Management · doi:10.1108/ajim-05-2014-0061 · Cited by 34
Zadeh, L. A. (1983) · Elsevier eBooks · doi:10.1016/b978-0-08-030253-9.50016-0 · Cited by 33
Knowledge Representation and Classical Logic
Lifschitz, V. (2008) · Cited by 33
Commonsense Interpretation of Triangle Behavior
Gordon, A. S. (2016) · Proceedings of the AAAI Conference on Artificial Intelligence · doi:10.1609/aaai.v30i1.9881 · Cited by 33
Computing change and specificity with equational logic programs
H�lldobler, S., & Thielscher, M. (1995) · Annals of Mathematics and Artificial Intelligence · doi:10.1007/bf01530895 · Cited by 33
Distance-based paraconsistent logics
Arieli, O. (2007) · International Journal of Approximate Reasoning · doi:10.1016/j.ijar.2007.07.002 · Cited by 33
On the intertranslatability of non‐monotonic logics
Janhunen, T. (1999) · Annals of Mathematics and Artificial Intelligence · doi:10.1023/a:1018915113814 · Cited by 33
np-spec: An Executable Specification Language for Solving All Problems in NP
Cadoli, M., Palopoli, L., Schaerf, A., & Vasile, D. (1998) · Lecture notes in computer science · doi:10.1007/3-540-49201-1_2 · Cited by 33
A Computational Theory of Dispositions
Zadeh, L. A. (1988) · Springer eBooks · doi:10.1007/978-3-642-83590-2_9 · Cited by 33
Robaldo, L., & Sun, X. (2017) · Journal of Logic and Computation · doi:10.1093/logcom/exx009 · Cited by 32
Living with Inconsistency and Taming Nonmonotonicity
Małuszyński, J., & Szałas, A. (2011) · Lecture notes in computer science · doi:10.1007/978-3-642-24206-9_22 · Cited by 32
Mueller, E. T. (2008) · Foundations of artificial intelligence · doi:10.1016/s1574-6526(07)03017-9 · Cited by 32
A logical framework for identifying quality knowledge from different data sources
Su, K., Huang, H., Wu, X., & Zhang, S. (2006) · Decision Support Systems · doi:10.1016/j.dss.2006.02.012 · Cited by 32
An argument-based approach to reasoning with specificity
Dũng, P. M., & Son, T. C. (2001) · Artificial Intelligence · doi:10.1016/s0004-3702(01)00134-5 · Cited by 32
Non-Monotonicity In Probabilistic Reasoning
Grosof, B. N. (1988) · Machine intelligence and pattern recognition · doi:10.1016/b978-0-444-70396-5.50027-3 · Cited by 32
A simple formalization of actions using circumscription
Kartha, G., & Lifschitz, V. (1995) · Cited by 32
Reducing belief revision to circumscription (and vice versa)
Liberatore, P., & Schaerf, M. (1997) · Artificial Intelligence · doi:10.1016/s0004-3702(97)00016-7 · Cited by 32
The inheritance of dynamic and deontic integrity constraints or: Does the boss have more rights?
Wieringa, R. J., Weigand, H., Meyer, J. C., & Dignum, F. P. M. (1991) · Annals of Mathematics and Artificial Intelligence · doi:10.1007/bf01530931 · Cited by 32
Defaults and revision in structured theories
Ryan, M. D. (2002) · ACM/IEEE Symposium on Logic in Computer Science (LICS) · doi:10.1109/lics.1991.151660 · Cited by 32
Arista, R., Mas, F., Morales-Palma, D., & Vallellano, C. (2023) · International Journal of Production Research · doi:10.1080/00207543.2023.2217296 · Cited by 31
Cooperative versus argumentative communication
van Rooij, R. (2004) · Philosophia Scientae · doi:10.4000/philosophiascientiae.576 · Cited by 31
A survey of techniques for inference under uncertainty
Sheridan, F. K. J. (1991) · Artificial Intelligence Review · doi:10.1007/bf00129537 · Cited by 31
Loop formulas for circumscription
Lee, J., & Lin, F. (2005) · Artificial Intelligence · doi:10.1016/j.artint.2005.09.003 · Cited by 31
A selected descriptor-indexed bibliography to the literature on belief revision
Doyle, J., & London, P. E. (1980) · ACM SIGART Bulletin · doi:10.1145/1056441.1056442 · Cited by 31
A Proposal of the New owlANT Method for Determining the Distance between Terms in Ontology
Czerniak, J. M., Dobrosielski, W. T., Zarzycki, H., & Apiecionek, Ł. (2014) · Advances in intelligent systems and computing · doi:10.1007/978-3-319-11310-4_21 · Cited by 30
Probabilistic Event Calculus Based on Markov Logic Networks
Skarlatidis, A., Παλιούρας, Γ., Vouros, G. A., & Artikis, A. (2011) · Lecture notes in computer science · doi:10.1007/978-3-642-24908-2_19 · Cited by 30
Branching vs. Linear Time: Semantical Perspective
Nain, S., & Vardi, M. Y. (2007) · Springer eBooks · doi:10.1007/978-3-540-75596-8_4 · Cited by 30
Any-world assumptions in logic programming
Loyer, Y., & Straccia, U. (2005) · Theoretical Computer Science · doi:10.1016/j.tcs.2005.04.005 · Cited by 30
Metadata
- Authors
- McCarthy, J.
- Affiliations
- Stanford University (US)
- Corresponding author
- McCarthy, John
- ORCID
- McCarthy, John
- Venue
- Artificial Intelligence
- Publisher
- Elsevier BV
- Published
- 1980-04
- Volume
- 13
- Issue
- 1-2
- Pages
- 27-39
- ISSN
- 0004-3702 (ISSN-L)
- OpenAlex
- W2945259913
- Cited by
- 2,017
- References
- 12
- Citations by year
- 2026: 21 · 2025: 19 · 2024: 17 · 2023: 19 · 2022: 17 · 2021: 22 · 2020: 29 · 2019: 30 · 2018: 38 · 2017: 28 · 2016: 32 · 2015: 41 · 2014: 68 · 2013: 46 · 2012: 55
- FWCI
- 10.97
- Type
- journal article
- Language
- en
- Open access
- closed
- Locations
- Artificial Intelligence (publishedVersion)
- Topics
- Physical Sciences › Computer Science › Artificial Intelligence › Logic, Reasoning, and Knowledge
- Physical Sciences › Computer Science › Artificial Intelligence › AI-based Problem Solving and Planning
- Physical Sciences › Computer Science › Artificial Intelligence › Multi-Agent Systems and Negotiation
- Keywords
- circumscription, nonmonotonic reasoning, default reasoning, closed world assumption
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
