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 601–700 of 1,000
New foundations for epistemic change*
Gillies, A. S. (2004) · Synthese · doi:10.1023/b:synt.0000012202.66263.b2 · Cited by 22
On the relationship between logic programming and non-monotonic reasoning
Przymusiński, T. C. (1988) · National Conference on Artificial Intelligence · Cited by 22
Applications of Protected Circumscription
Minker, J., & Perlis, D. R. (1984) · Lecture notes in computer science · doi:10.1007/978-0-387-34768-4_24 · Cited by 22
Reasoning agents in a dynamic world: The frame problem
Toth, J. A. (1995) · Artificial Intelligence · doi:10.1016/0004-3702(95)90043-8 · Cited by 22
On the role of artificial intelligence in music research
Camurri, A. (1990) · Interface · doi:10.1080/09298219008570568 · Cited by 21
On Context and the Open World Assumption
Moore, P. T., & Pham, H. V. (2015) · International Conference on Advanced Information Networking and Applications Workshops (WAINA) · doi:10.1109/waina.2015.7 · Cited by 21
Saribatur, Z. G., Erdem, E., & Patoğlu, V. (2014) · IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS) · doi:10.1109/iros.2014.6942965 · Cited by 21
Varzinczak, I. J. ́. (2018) · Logica Universalis · doi:10.1007/s11787-018-0211-x · Cited by 21
Introduction to Design Science Research in Information and Communication Technology
(2007) · Auerbach Publications eBooks · doi:10.1201/9781420059335.ch2 · Cited by 21
PDDL+: Modelling Continuous Time-dependent Effects
Fox, M., & Long, D. P. (2007) · Cited by 21
A design theory for software engineering
Hall, J. G., & Rapanotti, L. (2017) · Information and Software Technology · doi:10.1016/j.infsof.2017.01.010 · Cited by 21
Salem Benferhat, A., & Prade, H. M. (2005) · Cited by 21
Formalising the Fisherman's Folly puzzle
Cabalar, P., & Santos, P. E. (2010) · Artificial Intelligence · doi:10.1016/j.artint.2010.04.004 · Cited by 21
A New Normative Theory of Probabilistic Logic
Aleliunas, R. (1990) · Studies in cognitive systems · doi:10.1007/978-94-009-0553-5_16 · Cited by 21
Janhunen, T. (1998) · Lecture notes in computer science · doi:10.1007/3-540-49545-2_15 · Cited by 21
Preferring diagnoses by abduction
Ayeb, B., Marquis, P., & Rusinowitch, M. (1993) · IEEE Transactions on Systems Man and Cybernetics · doi:10.1109/21.256550 · Cited by 21
Language, logic and ontology: Uncovering the structure of commonsense knowledge
Saba, W. S. (2007) · International Journal of Human-Computer Studies · doi:10.1016/j.ijhcs.2007.02.002 · Cited by 21
Temporal relations in English and German narrative discourse
Schilder, F. (1997) · ERA · Cited by 21
Some extensions of constraint propagation of label sets
Yager, R. R. (1989) · International Journal of Approximate Reasoning · doi:10.1016/0888-613x(89)90022-4 · Cited by 21
Nickel, B. (2017) · doi:10.1002/9781118972090.ch18 · Cited by 21
Learning Abductive Reasoning Using Random Examples
Juba, B. (2016) · Proceedings of the AAAI Conference on Artificial Intelligence · doi:10.1609/aaai.v30i1.10099 · Cited by 20
Introduction to Design Science Research in Information and Communication Technology
Vaishnavi, V. K., Vaishnavi, V. K., & Kuechler, W. (2015) · CRC Press eBooks · doi:10.1201/b18448-5 · Cited by 20
An action language for multi-agent domains
Baral, C. R., Gelfond, G., Pontelli, E., & Son, T. C. (2021) · Artificial Intelligence · doi:10.1016/j.artint.2021.103601 · Cited by 20
A tableau prover for domain minimization
Lorenz, S. (1994) · Journal of Automated Reasoning · doi:10.1007/bf00881950 · Cited by 20
Managing search complexity in linguistic geometry
Stilman, B. (1997) · IEEE Transactions on Systems Man and Cybernetics Part B (Cybernetics) · doi:10.1109/3477.650058 · Cited by 20
The Deep Lexical Semantics of Emotions
Hobbs, J. R., & Gordon, A. S. (2011) · Text, speech and language technology · doi:10.1007/978-94-007-1757-2_3 · Cited by 20
Knowledge Representation with Logic Programs
Brewka, G., & Dix, J. (2005) · Springer eBooks · doi:10.1007/1-4020-3092-4_1 · Cited by 20
The Complexity of Circumscriptive Inference in Post’s Lattice
Thomas, M. E. (2009) · Lecture notes in computer science · doi:10.1007/978-3-642-04238-6_25 · Cited by 20
Logic programming in artificial intelligence
Kowalski, R. (1991) · International Joint Conference on Artificial Intelligence · Cited by 20
Metaphor, Modularity, and the Evolution of Conceptual Integration
Chiappe, D. L. (2000) · Metaphor and Symbol · doi:10.1207/s15327868ms1503_2 · Cited by 20
Tractable theories of multiple defeasible inheritance in ordinary nonmonotonic logics
Haugh, B. A. (1988) · Cited by 20
CURB your theory! A circumscriptive approach for inclusive interpretation of disjunctive information
Eiter, T., Gottlob, G., & Gurevich, Y. G. (1993) · Cited by 20
A logical account of causal and topological maps
Remolina, E., & Kuipers, B. J. (2001) · Cited by 20
Shoham, Y. (1987) · Cited by 20
Quotient Space Based Problem Solving: A Theoretical Foundation of Granular Computing
Zhang, L., & Zhang, B. (2014) · Cited by 20
Towards a Model Theory for Distributed RepresentationsPreprint
Guha, R. V. (2014) · arXiv (Cornell University) · doi:10.48550/arxiv.1410.5859 · Cited by 20
Rules and Logic Programming for the Web
Paschke, A. (2011) · Lecture notes in computer science · doi:10.1007/978-3-642-23032-5_6 · Cited by 19
Chhibber, R. (2014) · Cited by 19
Morgenstern, L., & McIlraith, S. A. (2010) · Artificial Intelligence · doi:10.1016/j.artint.2010.11.003 · Cited by 19
Besold, T. R., Garcez, A. D., Stenning, K., van der Torre, L., & van Lambalgen, M. (2017) · Minds and Machines · doi:10.1007/s11023-017-9428-3 · Cited by 19
Possible Worlds Semantics for Indicative and Counterfactual Conditionals?
Unterhuber, M. (2013) · De Gruyter eBooks · doi:10.1515/9783110323665 · Cited by 19
Extracting implicit knowledge from text
Durme, V., & Benjamin, D. J. (2009) · Cited by 19
On integrating event definition and event detection
Obeid, N., & Rao, R. B. K. N. (2009) · Knowledge and Information Systems · doi:10.1007/s10115-009-0193-3 · Cited by 19
First-order extension of the FLP stable model semantics via modified circumscription
Bartholomew, M., Lee, J., & Meng, Y. (2011) · doi:10.5591/978-1-57735-516-8/ijcai11-128 · Cited by 19
Flow-Directed Lightweight Closure Conversion
Siskind, J. M. (2000) · Cited by 19
A Dichotomy in the Complexity of Propositional Circumscription
Kirousis, L. M., & Kolaitis, P. G. (2004) · Theory of Computing Systems · doi:10.1007/s00224-004-1152-8 · Cited by 19
Deduction with supernormal defaults
Brass, S. (2006) · Springer eBooks · doi:10.1007/bfb0030392 · Cited by 19
Logic and Databases Past, Present, and Future
Minker, J. (1997) · AI Magazine · doi:10.1609/aimag.v18i3.1304 · Cited by 19
On compact representations of propositional circumscription
Cadoli, M., Donini, F. M., & Schaerf, M. (1995) · Lecture notes in computer science · doi:10.1007/3-540-59042-0_74 · Cited by 19
Integrating Discrete and Continuous Change in a Logical Framework
Pinto, J. A. (1998) · Computational Intelligence · doi:10.1111/0824-7935.00056 · Cited by 19
On the Relationship between Defeasible Logic and Well-Founded Semantics
Brewka, G. (2001) · Lecture notes in computer science · doi:10.1007/3-540-45402-0_9 · Cited by 19
Controlling expert system recommendations with defeasible logic
Nute, D. E., Mann, R. I., & Brewer, B. F. (1990) · Decision Support Systems · doi:10.1016/0167-9236(90)90005-c · Cited by 19
First-Order Stable Model Semantics and First-Order Loop FormulasPreprint
Lee, J., & Meng, Y. (2014) · arXiv (Cornell University) · doi:10.48550/arxiv.1401.3898 · Cited by 19
Logic, information and conversation
Piwek, P. P. (1998) · TU/e Research Portal · doi:10.6100/ir517817 · Cited by 19
Grahne, G., Mendelzon, A. O., & Revesz, P. Z. (1992) · ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (PODS) · doi:10.1145/137097.137882 · Cited by 19
Outlier detection using default reasoning
Angiulli, F., Zohary, R. B.-E. –., & Palopoli, L. (2008) · Artificial Intelligence · doi:10.1016/j.artint.2008.07.004 · Cited by 18
Assessing Public Metabolomics Metadata, Towards Improving Quality
Ferreira, J. D., Inácio, B., Salek, R. M., & Couto, F. M. (2017) · Berichte aus der medizinischen Informatik und Bioinformatik/Journal of integrative bioinformatics · doi:10.1515/jib-2017-0054 · Cited by 18
Bender, E. M., & Alex Lascarides, Y. (2019) · Synthesis lectures on human language technologies · doi:10.2200/s00935ed1v02y201907hlt043 · Cited by 18
Revisiting Information Hiding: Reflections on Classical and Nonclassical Modularity
Ostermann, K., Giarrusso, P. G., Kästner, C., & Rendel, T. (2011) · Cited by 18
The Inference Problem for Propositional Circumscription of Afine Formulas Is coNP-Complete
Durand, A., & Hermann, M. (2003) · Lecture notes in computer science · doi:10.1007/3-540-36494-3_40 · Cited by 18
McCarthy, J. (2000) · Springer eBooks · doi:10.1007/978-1-4615-1567-8_2 · Cited by 18
Self-citationModes of concept definition and varieties of vagueness
Bennett, B. (2005) · Applied Ontology · doi:10.3233/apo-2005-000007 · Cited by 18
Counterexample Guided Abstraction Refinement Algorithm for Propositional Circumscription
Janota, M., Grigore, R., & Marques-Silva, J. P. (2010) · Lecture notes in computer science · doi:10.1007/978-3-642-15675-5_18 · Cited by 18
Event calculus and temporal action logics compared
Mueller, E. T. (2006) · Artificial Intelligence · doi:10.1016/j.artint.2006.05.001 · Cited by 18
How AIS can progress along with ontology research in IS
Guan, J., Levitan, A. S., & Kuhn, J. R. (2012) · International Journal of Accounting Information Systems · doi:10.1016/j.accinf.2012.08.002 · Cited by 19
Makinson, D. (2005) · Springer eBooks · doi:10.1007/1-4020-3092-4_3 · Cited by 18
THE CONTEXT-SENSITIVITY OF BELIEF AND DESIRE
Thomason, R. H. (1987) · Elsevier eBooks · doi:10.1016/b978-0-934613-30-9.50017-2 · Cited by 18
Computational aerodynamics and artificial intelligence
Kutler, P., & Mehta, U. B. (1984) · AIAA Fluid Dynamics, Plasma Dynamics and Lasers Conference · doi:10.2514/6.1984-1531 · Cited by 18
A FRAMEWORK FOR LOGICS OF EXPLICIT BELIEF
Delgrande, J. P. (1995) · Computational Intelligence · doi:10.1111/j.1467-8640.1995.tb00023.x · Cited by 18
Syntactic Hierarchy for Robotic Systems
Stilman, B. (1993) · Integrated Computer-Aided Engineering · doi:10.3233/ica-1993-1105 · Cited by 18
Autoepistemic logic of knowledge and beliefs
Przymusiński, T. C. (1997) · Artificial Intelligence · doi:10.1016/s0004-3702(97)00032-5 · Cited by 18
del Val, Á. (1997) · Journal of Applied Non-Classical Logics · doi:10.1080/11663081.1997.10510906 · Cited by 18
Representing Paraconsistent Reasoning via Quantified Propositional Logic
Besnard, P., Schaub, T. H., Tompits, H., & Woltran, S. (2005) · Lecture notes in computer science · doi:10.1007/978-3-540-30597-2_4 · Cited by 18
AI, Logic, and the Frame Problem
McDermott, D. (1987) · Elsevier eBooks · doi:10.1016/b978-0-934613-32-3.50013-7 · Cited by 18
A generalization of collapsible cases of circumscription
Rabinov, A. (1989) · Artificial Intelligence · doi:10.1016/0004-3702(89)90070-2 · Cited by 18
Preference-based Semantics for Nonmonotonic LogicsPreprint
Voorbraak, F. P. J. M. (1993) · Utrecht University Repository (Utrecht University) · Cited by 18
Partitioning and composing knowledge
Wiederhold, G. C. M., Rathmann, P. K., Barsalou, T., Lee, B. S., & Quass, D. (1990) · Information Systems · doi:10.1016/0306-4379(90)90016-i · Cited by 18
Discussion of “Biomedical Ontologies: Toward Scientific Debate”
Brochhausen, M., Burgun, A., Ceusters, W. M., Hasman, A., Leong, T.-Y., Musen, M. A., Oliveira, J. L., Mor Peleg, B., Rector, A. L., & Schulz, S. (2011) · Methods of Information in Medicine · doi:10.1055/s-0038-1625243 · Cited by 18
Hierarchic autoepistemic theories for nonmonotonic reasoning: Preliminary report
Konolige, K. (1989) · Lecture notes in computer science · doi:10.1007/3-540-50701-9_19 · Cited by 18
Non-Monotonic Reasoning in Interpretation (Update of )
van Rooij, R., & Schulz, K. (2011) · Elsevier eBooks · doi:10.1016/b978-0-444-53726-3.00018-9 · Cited by 17
Hintikka, J., & Sandu, G. (2007) · Elsevier eBooks · doi:10.1016/b978-044451541-4/50004-x · Cited by 17
The logic of empirical theories revisited
van Benthem, J. (2011) · Synthese · doi:10.1007/s11229-011-9916-6 · Cited by 18
A knowledge operation model of synthesis
Tomiyama, T., Yoshioka, M., & TSUMAYA, A. (2002) · Springer eBooks · doi:10.1007/978-1-4471-3717-7_5 · Cited by 17
Co-authorship of Joint utterances in Japanese
Obana, Y., & Haugh, M. (2015) · Dialogue & Discourse · doi:10.5087/dad.2015.101 · Cited by 17
Understanding Satirical Articles Using Common-Sense
Goldwasser, D., & Zhang, X. (2016) · Transactions of the Association for Computational Linguistics · doi:10.1162/tacl_a_00116 · Cited by 17
Argumentation and Abduction in Dialogical Logic
Gómez, C. B., & Fontaine, M. (2017) · Springer eBooks · doi:10.1007/978-3-319-30526-4_14 · Cited by 17
The Pyglaf Argumentation Reasoner
Alviano, M. (2018) · DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) · doi:10.4230/oasics.iclp.2017.2 · Cited by 17
Possibilistic logic: From nonmonotonicity to logic programming
Salem Benferhat, A., Didier Dubois, A., & Prade, H. M. (2005) · Springer eBooks · doi:10.1007/bfb0028177 · Cited by 17
A QUALITATIVE MODEL OF DYNAMIC SCENE ANALYSIS AND INTERPRETATION IN AMBIENT INTELLIGENCE SYSTEMS
Bhatt, M., & Dylla, F. (2009) · International Journal of Robotics and Automation · doi:10.2316/journal.206.2009.3.206-3274 · Cited by 17
The complexity of reasoning for fragments of default logic
Beyersdorff, O., Meier, A., Thomas, M., & Vollmer, H. (2011) · Journal of Logic and Computation · doi:10.1093/logcom/exq061 · Cited by 17
DEJONG, G. F. (2014) · Chapman & Hall/CRC eBooks · doi:10.1201/9780429171529-37 · Cited by 17
The Complexity of Reasoning for Fragments of Default Logic
Beyersdorff, O., Meier, A., Thomas, M. E., & Vollmer, H. (2009) · Lecture notes in computer science · doi:10.1007/978-3-642-02777-2_7 · Cited by 17
Reasoning from Paradigms and Negative Evidence
Macagno, F., & Walton, D. (2011) · Pragmatics & Cognition · doi:10.1075/pc.19.1.04mac · Cited by 19
Connectionism, classical cognitive science and experimental psychology
Oaksford, M., Nick Chater, A., & Stenning, K. (1990) · AI & Society · doi:10.1007/bf01889765 · Cited by 17
Proof-complexity results for nonmonotonic reasoning
Egly, U., & Tompits, H. (2001) · ACM Transactions on Computational Logic · doi:10.1145/377978.377987 · Cited by 17
A decidable quantified defeasible logic
Nute, D. E. (1995) · Studies in logic and the foundations of mathematics · doi:10.1016/s0049-237x(06)80048-0 · Cited by 17
Why cognitive science is not formalized folk psychology
Pickering, M. J., & Nick Chater, A. (1995) · Minds and Machines · doi:10.1007/bf00974748 · Cited by 17
On Computing Belief Change Operations using Quantified Boolean Formulas
Delgrande, J. P. (2004) · Journal of Logic and Computation · doi:10.1093/logcom/14.6.801 · Cited by 17
INTELLIGENT BEHAVIOR IN MACHINES EMERGING FROM A COLLECTION OF INTERACTIVE CONTROL STRUCTURES
Cherian, S., & Troxell, W. O. (1995) · Computational Intelligence · doi:10.1111/j.1467-8640.1995.tb00050.x · Cited by 17
Denecker, M., & Ternovska, E. (2004) · Lirias · Cited by 17
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