Cited by 2,017Logic, Reasoning, and KnowledgeAI-based Problem Solving and PlanningMulti-Agent Systems and Negotiation

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

McCarthy, John·1980·Artificial Intelligence

DOI 10.1016/0004-3702(80)90011-9

Open this paper in CoChat — free account

Integrity signals

Registry

Crossref · 10.1016/0004-3702(80)90011-9

Cites

10 of 10 references verified0 citation errors · 0 not checkable

Statistics

Recomputing p-values needs the paper’s full text.

Claims the paper makes

We couldn’t retrieve this paper’s full text, so its claims and self-check weren’t run. The registry and citation checks still apply.

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?

A logic for default reasoning
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-citation
Non-monotonic logic I
McDermott, D., & Doyle, J. (1980) · Artificial Intelligence · doi:10.1016/0004-3702(80)90012-0 · Cited by 912
Programs with common sense
McCarthy, J. (1960) · Cited by 799
Self-citation
EPISTEMOLOGICAL PROBLEMS OF ARTIFICIAL INTELLIGENCE
McCarthy, J. (1981) · Elsevier eBooks · doi:10.1016/b978-0-934613-03-3.50035-0 · Cited by 327
Self-citation
Description and Theoretical Analysis (Using Schemata) of Planner: A Language for Proving Theorems and Manipulating Models in a Robot
Hewitt, 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-citation
Philosophical 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

Show all 12 references

Sorted by citations

Items 201–300 of 1,000

A computational theory of dispositions
Zadeh, L. A. (1984) · Proceedings of the conference - Association for Computational Linguistics. Meeting · doi:10.3115/980491.980555 · Cited by 91
Inductive Policy: The Pragmatics of Bias Selection
Provost, F. J., & Buchanan, B. G. (1995) · Machine Learning · doi:10.1007/bf00993474 · Cited by 91
Acyclic programs
Apt, K. R., & Bezem, M. (1991) · New Generation Computing · doi:10.1007/bf03037168 · Cited by 90
Static semantics for normal and disjunctive logic programs
Przymusiński, T. C. (1995) · Annals of Mathematics and Artificial Intelligence · doi:10.1007/bf01530826 · Cited by 90
On the adequacy of predicate circumscription for closed‐world reasoning
Etherington, D. W., Mercer, R. E., & Reiter, R. (1985) · Computational Intelligence · doi:10.1111/j.1467-8640.1985.tb00055.x · Cited by 90
Knowledge Representation and Ontologies
Grimm, S. (2009) · Springer eBooks · doi:10.1007/978-3-642-02788-8_6 · Cited by 89
Chapter 7 Answer Sets
Gelfond, M. (2008) · Foundations of artificial intelligence · doi:10.1016/s1574-6526(07)03007-6 · Cited by 89
Impediments to universal preference-based default theories
Doyle, J., & Wellman, M. P. (1991) · Artificial Intelligence · doi:10.1016/0004-3702(91)90007-7 · Cited by 89
General logical databases and programs: Default logic semantics and stratification
Bidoít, N., & Froidevaux, C. (1991) · Information and Computation · doi:10.1016/0890-5401(91)90073-b · Cited by 89
A circumscriptive theorem prover
Ginsberg, M. L. (1989) · Artificial Intelligence · doi:10.1016/0004-3702(89)90026-x · Cited by 89
ONTOLOGY REPRESENTATION -- Design Patterns and Ontologies that Make Sense
Hoekstra, R. (2009) · UvA-DARE (University of Amsterdam) · Cited by 89
Temporal representation and reasoning in artificial intelligence: Issues and approaches
Chittaro, L., & Montanari, A. (2000) · Annals of Mathematics and Artificial Intelligence · doi:10.1023/a:1018900105153 · Cited by 108
On the computational complexity of assumption-based argumentation for default reasoning
Dimopoulos, Y., Nebel, B., & Toni, F. (2002) · Artificial Intelligence · doi:10.1016/s0004-3702(02)00245-x · Cited by 88
Reasoning with infinite stable models
Bonatti, P. A. (2004) · Artificial Intelligence · doi:10.1016/j.artint.2004.02.001 · Cited by 88
DATMS: A Framework for Distributed Assumption Based Reasoning
Mason, C. L., & Johnson, R. R. (1989) · Elsevier eBooks · doi:10.1016/b978-1-55860-092-8.50017-4 · Cited by 88
Probabilistic reasoning and the computation of scalar implicatures
Russell, B. (2012) · doi:10.7301/z08s4n70 · Cited by 87
Architecture of the World Wide Web
Harry Halpin, A. (2012) · Semantic web and beyond · doi:10.1007/978-1-4614-1885-6_2 · Cited by 86
Minimal Sets over Monotone Predicates in Boolean Formulae
Marques-Silva, J. P., Janota, M., & Belov, A. (2013) · Lecture notes in computer science · doi:10.1007/978-3-642-39799-8_39 · Cited by 86
Presumption and the Practices of Tentative Cognition
Rescher, N. (2006) · Cambridge University Press eBooks · doi:10.1017/cbo9780511498848 · Cited by 86
Is Logicist Cognitive Science Possible?
Garnham, A. (1993) · Mind & Language · doi:10.1111/j.1468-0017.1993.tb00270.x · Cited by 85
A theory of defeasible reasoning
Pollock, J. L. (1991) · International Journal of Intelligent Systems · doi:10.1002/int.4550060103 · Cited by 85
Extending Classical Logic with Inductive Definitions
Denecker, M. (2000) · Lecture notes in computer science · doi:10.1007/3-540-44957-4_47 · Cited by 84
Semantic Interpretation as Computation in Nonmonotonic Logic: The Real Meaning of the Suppression Task
Stenning, K., & van Lambalgen, M. (2005) · Cognitive Science · doi:10.1207/s15516709cog0000_36 · Cited by 83
The First Answer Set Programming System Competition
Gebser, M., Liu, L., Namasivayam, G., Neumann, A., Schaub, T. H., & Truszczyński, M. (2007) · Springer eBooks · doi:10.1007/978-3-540-72200-7_3 · Cited by 83
The Three Faces of Defeasibility in the Law
Prakken, H., & Giovanni Sartor, B. (2004) · Ratio Juris · doi:10.1111/j.0952-1917.2004.00259.x · Cited by 83
Computational Logic and Human Thinking: How to Be Artificially Intelligent
Kowalski, R. (2011) · Cited by 84
A family of defeasible reasoning logics and its implementation
Antoniou, G., Billington, D. P., Guido Governatori, A., Maher, M. J., & Rock, A. (2000) · Griffith Research Online · Cited by 82
Event Calculus Reasoning Through Satisfiability
Mueller, E. T. (2004) · Journal of Logic and Computation · doi:10.1093/logcom/14.5.703 · Cited by 82
Logic and databases: A 20 year retrospective
Minker, J. (1996) · Lecture notes in computer science · doi:10.1007/bfb0031734 · Cited by 82
Defeasible Reasoning: A Philosophical Analysis in Prolog
Nute, D. (1988) · Studies in cognitive systems · doi:10.1007/978-94-009-2699-8_9 · Cited by 92
A Review of Uncertainty Handling Formalisms
Parsons, S., & Hunter, A. (1998) · Lecture notes in computer science · doi:10.1007/3-540-49426-x_2 · Cited by 80
TALPLANNER A Temporal Logic-Based Planner
Doherty, P., & Kvarnström, J. (2001) · doi:10.1609/aimag.v22i3.1581 · Cited by 80
Defeasible logic programming: DeLP-servers, contextual queries, and explanations for answers
García, A. J., & Simari, G. R. (2014) · Argument & Computation · doi:10.1080/19462166.2013.869767 · Cited by 79
The complexity of propositional closed world reasoning and circumscription
Cadoli, M., & Maurizio Lenzerini, B. (1994) · Journal of Computer and System Sciences · doi:10.1016/s0022-0000(05)80004-2 · Cited by 79
Efficient reasoning
Greiner, R., Darken, C. J., & Santoso, N. I. (2001) · ACM Computing Surveys · doi:10.1145/375360.375363 · Cited by 79
An alternative approach to the semantics of disjunctive logic programs and deductive databases
Sakama, C., & Inoue, K. (1994) · Journal of Automated Reasoning · doi:10.1007/bf00881915 · Cited by 79
Circumscription implies predicate completion (sometimes)
Reiter, R. (1982) · National Conference on Artificial Intelligence · Cited by 79
Towards an Integration of Answer Set and Constraint Solving
Baselice, S., Bonatti, P. A., & Gelfond, M. (2005) · Lecture notes in computer science · doi:10.1007/11562931_7 · Cited by 78
Toward a Useful Concept of Causality for Lexical Semantics
Hobbs, J. R. (2005) · Journal of Semantics · doi:10.1093/jos/ffh024 · Cited by 77
The relationship between stable, supported, default and autoepistemic semantics for general logic programs
Marek, W., & Subrahmanian, V. S. (1992) · Theoretical Computer Science · doi:10.1016/0304-3975(92)90019-c · Cited by 77
Constructing argument graphs with deductive arguments: a tutorial
Besnard, P., & Hunter, A. (2014) · Argument & Computation · doi:10.1080/19462166.2013.869765 · Cited by 77
Prioritised fuzzy constraint satisfaction problems: axioms, instantiation and validation
Luo, X., Lee, J. H. M., Leung, H.-F., & Jennings, N. R. (2003) · Fuzzy Sets and Systems · doi:10.1016/s0165-0114(02)00385-8 · Cited by 77
Subtractive reductions and complete problems for counting complexity classes
Durand, A., Hermann, M., & Kolaitis, P. G. (2000) · Mathematical Foundations of Computer Science · doi:10.1016/j.tsc.2005.03.012 · Cited by 76
Tractable Closed World Reasoning with Updates
Etzioni, O., Golden, K., & Weld, D. S. (1994) · Principles of Knowledge Representation and Reasoning · doi:10.1016/b978-1-4832-1452-8.50113-5 · Cited by 76
A tutorial on default logics
Antoniou, G. (1999) · ACM Computing Surveys · doi:10.1145/344588.344602 · Cited by 76
Extending and Implementing the Stable Model SemanticsPreprint
Simons, P. (2000) · arXiv (Cornell University) · doi:10.48550/arxiv.cs/0005010 · Cited by 76
Survey on robotic systems for internal logistics
Bernardo, R. M. C., Sousa, J. M. C., & Gonçalves, P. J. S. (2022) · Journal of Manufacturing Systems · doi:10.1016/j.jmsy.2022.09.014 · Cited by 80
Some representational issues in default reasoning
Reiter, R., & Criscuolo, G. (1983) · Computers & Mathematics with Applications · doi:10.1016/0898-1221(83)90004-4 · Cited by 75
Indefeasible Semantics and Defeasible PragmaticsPreprint
Kameyama, M. (1995) · arXiv (Cornell University) · doi:10.48550/arxiv.cmp-lg/9506016 · Cited by 75
Modeling the Design Process
Yagiu, T. (1991) · Computer graphics · doi:10.1007/978-3-642-84420-1_9 · Cited by 74
Deontic logic as founded on nonmonotonic logic
Horty, J. F. (1993) · Annals of Mathematics and Artificial Intelligence · doi:10.1007/bf01531262 · Cited by 74
Circumscription and Disjunctive Logic Programming
Minker, J., Lobo, J., & Rajasekar, A. (1991) · Elsevier eBooks · doi:10.1016/b978-0-12-450010-5.50022-0 · Cited by 74
The complexity of model checking for circumscriptive formulae
Cadoli, M. (1992) · Information Processing Letters · doi:10.1016/0020-0190(92)90049-2 · Cited by 73
Hypothetical Reasoning in Causal Models
Console, L., & Torasso, P. (1990) · International Journal of Intelligent Systems · doi:10.1002/int.1990.5.1.83 · Cited by 73
Representing Preferences as Ceteris Paribus Comparatives
Doyle, J., & Wellman, M. P. (1994) · Cited by 73
Pointwise circumscription: preliminary report
Lifschitz, V. (1986) · Cited by 73
Understanding script-based stories using commonsense reasoning
Mueller, E. T. (2004) · Cognitive Systems Research · doi:10.1016/j.cogsys.2004.06.001 · Cited by 72
Lying versus refusal for known potential secrets
Biskup, J., & Bonatti, P. A. (2001) · Data & Knowledge Engineering · doi:10.1016/s0169-023x(01)00024-6 · Cited by 72
Living up to expectations: computing expert responses
Joshi, A. K., Webber, B., & Weischedel, R. (1984) · ScholarlyCommons (University of Pennsylvania) · Cited by 72
Cognitive Design for Artificial Minds
Lieto, A. (2021) · Routledge eBooks · doi:10.4324/9781315460536 · Cited by 70
Knowledge level engineering: ontological analysis
Alexander, J. H., Freiling, M. J., Shulman, S. J., Staley, J. L., Rehfuss, S., & Messick, S. L. (1986) · National Conference on Artificial Intelligence · Cited by 70
Reasoning about actions and planning in LTL action theories
Calvanese, D., Giacomo, G. D., & Vardi, M. Y. (2002) · Cited by 70
Chronological ignorance: Time, nonmonotonicity, necessity and causal theories
Shoham, Y. (1986) · Cited by 70
Topic, Focus, and Exhaustive Interpretation
van Rooij, R., & Schulz, K. (2017) · Studies in natural language and linguistic theory · doi:10.1007/978-3-319-10106-4_4 · Cited by 69
Knowledge Representation and Ontologies
Stephan, G. ∈., Pascal, H. ∈., & Abecker, A. (2007) · Springer eBooks · doi:10.1007/3-540-70894-4_3 · Cited by 67
Localized event‐based reasoning for multiagent domain1
Lansky, A. L. (1988) · Computational Intelligence · doi:10.1111/j.1467-8640.1988.tb00282.x · Cited by 67
Problems and Promises of Computational Logic
Kowalski, R. (1990) · Springer eBooks · doi:10.1007/978-3-642-76274-1_1 · Cited by 67
Defeasible Inclusions in Low-Complexity DLsPreprint
Bonatti, P. A., Faella, M., & Sauro, L. (2014) · arXiv (Cornell University) · doi:10.48550/arxiv.1401.3901 · Cited by 67
AI Reasoning in Deep Learning Era: From Symbolic AI to Neural–Symbolic AI
Liang, B., Wang, Y., & Tong, C. (2025) · Mathematics · doi:10.3390/math13111707 · Cited by 100
Ethnomathematics
Ascher, M., & Ascher, R. (1986) · History of Science · doi:10.1177/007327538602400202 · Cited by 66
OSCAR: a general theory of rationality
Pollock, J. L. (1989) · Journal of Experimental & Theoretical Artificial Intelligence · doi:10.1080/09528138908953702 · Cited by 65
A new fixpoint semantics for general logic programs compared with the well-founded and the stable model semantics
Fages, F. (1991) · New Generation Computing · doi:10.1007/bf03037172 · Cited by 65
Précis ofDeduction
Johnson-Laird, P. N., & Byrne, R. M. J. (1993) · Behavioral and Brain Sciences · doi:10.1017/s0140525x00030260 · Cited by 67
A theory of nonmonotonic rule systems I
Marek, W., Nerode, A., & Remmel, J. B. (1990) · Annals of Mathematics and Artificial Intelligence · doi:10.1007/bf01531080 · Cited by 65
Negation in rule-based database languages: a survey
Bidoít, N. (1991) · Theoretical Computer Science · doi:10.1016/0304-3975(51)90003-5 · Cited by 65
A procedural semantics for well founded negation in logic programs
Ross, K. A. (1989) · ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (PODS) · doi:10.1145/73721.73724 · Cited by 65
Argument in Artificial Intelligence and Law
Bench-Capon, T. J. M. (1997) · Artificial Intelligence and Law · doi:10.1023/a:1008242417011 · Cited by 64
Results on translating defaults to circumscription
Imieliński, T. (1987) · Artificial Intelligence · doi:10.1016/0004-3702(87)90064-6 · Cited by 64
Thinking Like a Skeptic: Defeasible Inference in Natural Language
Rudinger, R., Shwartz, V., Hwang, J. D., Bhagavatula, C., Forbes, M., Bras, R. J. L., Smith, N. A., & Choi, Y. (2020) · Findings of the Association for Computational Linguistics: EMNLP (Findings of EMNLP) · doi:10.18653/v1/2020.findings-emnlp.418 · Cited by 78
Temporal Reasoning in Artificial Intelligence
Shoham, Y., & Goyal, N. (1988) · Elsevier eBooks · doi:10.1016/b978-0-934613-67-5.50015-0 · Cited by 63
The complexity of circumscription in description logic
Bonatti, P. A., Lutz, C., & Wolter, F. (2009) · doi:10.5555/1641503.1641520 · Cited by 62
Preprocessing of Intractable Problems
Cadoli, M., Donini, F. M., Liberatore, P., & Schaerf, M. (2002) · Information and Computation · doi:10.1006/inco.2001.3043 · Cited by 62
Soundness and completeness theorems for three formalizations of action
Kartha, G. (1993) · International Joint Conference on Artificial Intelligence · Cited by 62
Perspectives in deductive databases
Minker, J. (1988) · The Journal of Logic Programming · doi:10.1016/0743-1066(88)90006-4 · Cited by 61
On the satisfiability of circumscription
Lifschitz, V. (1986) · Artificial Intelligence · doi:10.1016/0004-3702(86)90028-7 · Cited by 61
Toward an engineering science of knowledge-based design
Tong, C. (1987) · Artificial Intelligence in Engineering · doi:10.1016/0954-1810(87)90203-2 · Cited by 61
Norms in multiagent systems: From theory to practice
Vázquez-Salceda, J., Aldewereld, H., & Dignum, F. P. M. (2005) · Utrecht University Repository (Utrecht University) · Cited by 60
Representing default knowledge in biomedical ontologies: application to the integration of anatomy and phenotype ontologies
Hoehndorf, R., Frank Loebe, A., Kelso, J. F., & Heinrich Herre, B. (2007) · BMC Bioinformatics · doi:10.1186/1471-2105-8-377 · Cited by 57
A logic of knowledge and justified assumptions
Lin, F., & Shoham, Y. (1992) · Artificial Intelligence · doi:10.1016/0004-3702(92)90019-t · Cited by 60
Adding disjunction to datalog (extended abstract)
Eiter, T., Gottlob, G., & Mannila, H. (1994) · ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (PODS) · doi:10.1145/182591.182639 · Cited by 60
A REPRESENTATION OF PARALLEL ACTIVITY BASED ON EVENTS, STRUCTURE, AND CAUSALITY
Lansky, A. L. (1987) · Elsevier eBooks · doi:10.1016/b978-0-934613-30-9.50009-3 · Cited by 60
Modal logic for default reasoning
Marek, W., & Truszczyński, M. (1990) · Annals of Mathematics and Artificial Intelligence · doi:10.1007/bf01531081 · Cited by 60
Inductive situation calculus
Denecker, M., & Ternovska, E. (2007) · Artificial Intelligence · doi:10.1016/j.artint.2007.02.002 · Cited by 59
Clausal intuitionistic logic II. tableau proof procedures
McCarty, L. T. (1988) · The Journal of Logic Programming · doi:10.1016/0743-1066(88)90014-3 · Cited by 59
Reasoning under Uncertainty in Natural Language Dialogue using Bayesian Networks
Keizer, S. (2003) · University of Twente Research Information · Cited by 59
Towards intelligent decision support systems for emergency managers: the IDA approach
Gadomski, A. M., Bologna, S., Costanzo, G. D., Perini, A., & Schaerf, M. (2001) · International Journal of Risk Assessment and Management · doi:10.1504/ijram.2001.001507 · Cited by 58
String constraints with concatenation and transducers solved efficiently
Holík, L., Janků, P., Lin, A. W., Rümmer, P., & Vojnar, T. (2017) · Proceedings of the ACM on Programming Languages · doi:10.1145/3158092 · Cited by 58
Thirteen Definitions of a Stable Model
Lifschitz, V. (2010) · Lecture notes in computer science · doi:10.1007/978-3-642-15025-8_24 · Cited by 58
NP-SPEC: an executable specification language for solving all problems in NP
Cadoli, M., Ianni, G., Palopoli, L., Schaerf, A., & Vasile, D. (2000) · Computer Languages · doi:10.1016/s0096-0551(01)00010-8 · Cited by 58
Resolving ambiguity in nonmonotonic inheritance hierarchies
Stein, L. A. (1992) · Artificial Intelligence · doi:10.1016/0004-3702(92)90057-5 · Cited by 58

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)
DOI: 10.1016/0004-3702(80)90011-9
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
Licence: www.elsevier.com/tdm/userlicense/1.0/ (tdm)
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

Circumscription—A form of non-monotonic reasoning

Overview

Integrity signals

Verification

Claims the paper makes

Claims other papers make about this one

Citations

Cites

Cited by

Related

Metadata

Record

About these checks