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 301–400 of 1,000

Formal theories of action (preliminary report)
Lifschitz, V. (1987) · International Joint Conference on Artificial Intelligence · Cited by 58
On the consistency of commonsense reasoning
Perlis, D. R. (1986) · Computational Intelligence · doi:10.1111/j.1467-8640.1986.tb00083.x · Cited by 58
The Stable Models of a Predicate Logic Program
Marek, V. W., Nerode, A., & Remmel, J. B. (1994) · The Journal of Logic Programming · doi:10.1016/s0743-1066(14)80008-3 · Cited by 58
Foundations of Everyday Practical Reasoning
Lin, H. (2013) · Journal of Philosophical Logic · doi:10.1007/s10992-013-9296-0 · Cited by 57
Subtractive Reductions and Complete Problems for Counting Complexity Classes
Durand, A., Hermann, M., & Kolaitis, P. G. (2000) · Lecture notes in computer science · doi:10.1007/3-540-44612-5_28 · Cited by 64
Inheritance comes of age: applying nonmonotonic techniques to problems in industry
Morgenstern, L. (1998) · Artificial Intelligence · doi:10.1016/s0004-3702(98)00073-3 · Cited by 57
Introduction: Progress in formal commonsense reasoning
Davis, E., & Morgenstern, L. (2003) · Artificial Intelligence · doi:10.1016/j.artint.2003.09.001 · Cited by 56
Local Closed World Semantics: Grounded Circumscription for OWL
Sengupta, K., Krisnadhi, A. A., & Hitzler, P. (2011) · Lecture notes in computer science · doi:10.1007/978-3-642-25073-6_39 · Cited by 56
Replanning in domains with partial information and sensing actions
Brafman, R. I., & Shani, G. (2011) · Cited by 56
The Qualification Problem: A solution to the problem of anomalous models
Thielscher, M. (2001) · Artificial Intelligence · doi:10.1016/s0004-3702(01)00131-x · Cited by 56
Semantics of disjunctive logic programs and deductive databases
Przymusiński, T. C. (1991) · Lecture notes in computer science · doi:10.1007/3-540-55015-1_5 · Cited by 56
The extended closed world assumption and its relationship to parallel circumscription
Gelfond, M., Przymusinska, H., & Przymusiński, T. C. (1985) · ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (PODS) · doi:10.1145/6012.15410 · Cited by 56
Model-preference default theories
Selman, B., & Kautz, H. (1990) · Artificial Intelligence · doi:10.1016/0004-3702(90)90010-w · Cited by 56
Formalizing GDPR Provisions in Reified I/O Logic: The DAPRECO Knowledge Base
Robaldo, L., Bartolini, C., Palmirani, M., Rossi, A., Martoni, M., & Lenzini, G. (2019) · Journal of Logic Language and Information · doi:10.1007/s10849-019-09309-z · Cited by 55
Foundations of knowledge representation and reasoning
Lakemeyer, G., & Nebel, B. (1994) · Lecture notes in computer science · doi:10.1007/3-540-58107-3_1 · Cited by 55
Sequent calculi for propositional nonmonotonic logics
Bonatti, P. A., & Olivetti, N. (2002) · ACM Transactions on Computational Logic · doi:10.1145/505372.505374 · Cited by 55
Computing with default logic
Cholewiński, P., Marek, V. W., Truszczyński, M., & Mikitiuk, A. (1999) · Artificial Intelligence · doi:10.1016/s0004-3702(99)00053-3 · Cited by 55
On the interaction between plan recognition and intelligent interfaces
Goodman, B. A., & Litman, D. J. (1992) · User Modeling and User-Adapted Interaction · doi:10.1007/bf01101860 · Cited by 55
On Open Defaults
Lifschitz, V. (1990) · Springer eBooks · doi:10.1007/978-3-642-76274-1_3 · Cited by 55
Probabilistic Event Calculus for Event Recognition
Skarlatidis, A., Paliouras, G., Artikis, A., & Vouros, G. (2012) · ACM Transactions on Computational Logic · doi:10.1145/2699916 · Cited by 78
Artificial intelligence and the future
Clocksin, W. F. (2003) · Philosophical Transactions of the Royal Society A Mathematical Physical and Engineering Sciences · doi:10.1098/rsta.2003.1232 · Cited by 54
Information and evidence in logic systems
Lozinskii, E. L. (1994) · Journal of Experimental & Theoretical Artificial Intelligence · doi:10.1080/09528139408953787 · Cited by 52
Some computational aspects of circumscription
Kolaitis, P. G., & Papadimitriou, C. H. (1990) · Journal of the ACM · doi:10.1145/78935.78936 · Cited by 54
The Logic of Incomplete Knowledge Bases
Levesque, H. J. (1984) · Topics in information systems · doi:10.1007/978-1-4612-5196-5_7 · Cited by 54
How Children Deal with Natural Language Quantification
Freeman, N. H., & Stedmon, J. A. (1986) · Advances in psychology · doi:10.1016/s0166-4115(09)60131-x · Cited by 53
UFOme: An ontology mapping system with strategy prediction capabilities
Pirrò, G., & Talia, D. (2010) · Data & Knowledge Engineering · doi:10.1016/j.datak.2009.12.002 · Cited by 53
Some theories of reasoned assumptions : an essay in rational psychology
Doyle, J. (2018) · Figshare · doi:10.1184/r1/6609674 · Cited by 53
A neuroidal architecture for cognitive computation
Valiant, L. G. (2000) · Journal of the ACM · doi:10.1145/355483.355486 · Cited by 55
Argumentation in Multi-Agent Systems: Context and Recent Developments
Nicolas Maudet, B., Parsons, S., & Rahwan, I. (2007) · Lecture notes in computer science · doi:10.1007/978-3-540-75526-5_1 · Cited by 53
Three-valued nonmonotonic formalisms and semantics of logic programs
Przymusiński, T. C. (1991) · Artificial Intelligence · doi:10.1016/0004-3702(91)90013-a · Cited by 53
Lazy explanation-based learning: a solution to the intractable theory problem
Tadepalli, P. V. (1989) · International Joint Conference on Artificial Intelligence · Cited by 53
Artificial dreams: the quest for non-biological intelligence
(2008) · Choice Reviews Online · doi:10.5860/choice.46-1526 · Cited by 53
Dialogue games that agents play within a society
Karunatillake, N. C., Jennings, N. R., Rahwan, I., & McBurney, P. (2009) · Artificial Intelligence · doi:10.1016/j.artint.2009.02.002 · Cited by 52
A generalization of the Lin-Zhao theorem
Ferraris, P., Lee, J., & Lifschitz, V. (2006) · Annals of Mathematics and Artificial Intelligence · doi:10.1007/s10472-006-9025-2 · Cited by 52
A framed temporal logic programming language
Duan, Z., & Koutny, M. (2004) · Journal of Computer Science and Technology · doi:10.1007/bf02944904 · Cited by 52
Temporal representation and reasoning in artificial intelligence: A review
Pani, A. K., & Bhattacharjee, G. P. (2001) · Mathematical and Computer Modelling · doi:10.1016/s0895-7177(01)00049-8 · Cited by 65
Rigor mortis: A response to Nilsson's “Logic and artificial intelligence”
Birnbaum, L. A. (1991) · Artificial Intelligence · doi:10.1016/0004-3702(91)90050-t · Cited by 52
An overview of nonmonotonic reasoning and logic programming
Minker, J. (1993) · The Journal of Logic Programming · doi:10.1016/0743-1066(93)90028-f · Cited by 52
Overview of disjunctive logic programming
Minker, J. (1994) · Annals of Mathematics and Artificial Intelligence · doi:10.1007/bf01530759 · Cited by 52
Semantical and computational aspects of Horn approximations
Cadoli, M., & Scarcello, F. (2000) · Artificial Intelligence · doi:10.1016/s0004-3702(00)00010-2 · Cited by 52
Active Logics: A Unified Formal Approach to Episodic Reasoning
Elgot-Drapkin, J. J., Kraus, S., Miller, M. J., Nirkhe, M., & Perlis, D. R. (1999) · University Libraries (University of Maryland) · Cited by 52
A Survey on Applications of Quantified Boolean Formulas
Shukla, A., Biere, A., Pulina, L., & Seidl, M. (2019) · IEEE International Conference on Tools with Artificial Intelligence (ICTAI) · doi:10.1109/ictai.2019.00020 · Cited by 51
Twelve Definitions of a Stable Model
Lifschitz, V. (2008) · Lecture notes in computer science · doi:10.1007/978-3-540-89982-2_8 · Cited by 51
Preferences and Nonmonotonic Reasoning
Brewka, G., Niemelä, I., & Truszczyński, M. (2008) · AI Magazine · doi:10.1609/aimag.v29i4.2179 · Cited by 51
Benchmark problems for formal nonmonotonic reasoning
Lifschitz, V. (1988) · Lecture notes in computer science · doi:10.1007/3-540-50701-9_29 · Cited by 51
On computing minimal models
Ben-Eliyahu, R., & Dechter, R. (1996) · Annals of Mathematics and Artificial Intelligence · doi:10.1007/bf02136172 · Cited by 50
A reductive semantics for counting and choice in answer set programming
Lee, J., Lifschitz, V., & Palla, R. (2008) · Cited by 50
Nonmonotonic Reasoning: Towards Efficient Calculi and Implementations
Dix, J., Furbach, U., Niemelä, I., Brewka, G., & Truszczyński, M. (2001) · Elsevier eBooks · doi:10.1016/b978-044450813-3/50021-7 · Cited by 50
Motivated action theory: a formal theory of causal reasoning
Stein, L. A., & Morgenstern, L. (1994) · Artificial Intelligence · doi:10.1016/0004-3702(94)90061-2 · Cited by 50
Completeness results for circumscription
Perlis, D. R., & Minker, J. (1986) · Artificial Intelligence · doi:10.1016/0004-3702(86)90029-9 · Cited by 50
Thinking may be more than computing
Kugel, P. (1986) · Cognition · doi:10.1016/0010-0277(86)90057-0 · Cited by 49
Abduction, experience, and goals: a model of everyday abductive explanation
Leake, D. B. (1995) · Journal of Experimental & Theoretical Artificial Intelligence · doi:10.1080/09528139508953820 · Cited by 49
Default reasoning from conditional knowledge bases: Complexity and tractable cases
Eiter, T., & Lukasiewicz, T. (2000) · Artificial Intelligence · doi:10.1016/s0004-3702(00)00073-4 · Cited by 49
Logic-based subsumption architecture
Eyal Amir, A., & Maynard-Reid, P. (2003) · Artificial Intelligence · doi:10.1016/j.artint.2003.07.001 · Cited by 49
Time, logic and computation
van Benthem, J. (1988) · REX Workshop · doi:10.1007/bfb0013020 · Cited by 50
On the relation between default theories and autoepistemic logic
Konolige, K. (1987) · International Joint Conference on Artificial Intelligence · Cited by 49
Promoting Relevance in IS Research: An Informing System for Design Science Research
Kuechler, W. L., Jr., & Vaishnavi, V. (2011) · Informing Science The International Journal of an Emerging Transdiscipline · doi:10.28945/1498 · Cited by 46
Argumentation and Answer Set Programming
Toni, F., & Sergot, M. J. (2011) · Lecture notes in computer science · doi:10.1007/978-3-642-20832-4_11 · Cited by 48
Reformulating the Situation Calculus and the Event Calculus in the General Theory of Stable Models and in Answer Set Programming
Lee, J., & Palla, R. (2012) · Journal of Artificial Intelligence Research · doi:10.1613/jair.3489 · Cited by 48
A theory of nonmonotonic rule systems
Marek, W., Nerode, A., & Remmel, J. B. (2002) · ACM/IEEE Symposium on Logic in Computer Science (LICS) · doi:10.1109/lics.1990.113736 · Cited by 48
Why things go wrong: a formal theory of causal reasoning
Morgenstern, L., & Stein, L. A. (1988) · National Conference on Artificial Intelligence · Cited by 48
Chapter 18 Temporal Action Logics
Doherty, P., & Kvarnström, J. (2008) · Foundations of artificial intelligence · doi:10.1016/s1574-6526(07)03018-0 · Cited by 47
The Inverse Satisfiability Problem
Kavvadias, D. J., & Sideri, M. (1998) · SIAM Journal on Computing · doi:10.1137/s0097539795285114 · Cited by 47
A procedural semantics for well-founded negation in logic programs
Ross, K. A. (1992) · The Journal of Logic Programming · doi:10.1016/0743-1066(92)90019-y · Cited by 47
Nested abnormality theories
Lifschitz, V. (1995) · Artificial Intelligence · doi:10.1016/0004-3702(95)98594-e · Cited by 47
The Complexity of Minimal Satisfiability Problems
Kirousis, L. M., & Kolaitis, P. G. (2001) · Lecture notes in computer science · doi:10.1007/3-540-44693-1_36 · Cited by 47
Compiling circumscriptive theories into logic programs
Gelfond, M., & Lifschitz, V. (1989) · Lecture notes in computer science · doi:10.1007/3-540-50701-9_21 · Cited by 47
Defeasible Reasoning
Pollock, J. L. (2008) · Cambridge University Press eBooks · doi:10.1017/cbo9780511814273.025 · Cited by 46
Nonmonotonicity in Linguistics
Thomason, R. H. (1997) · Elsevier eBooks · doi:10.1016/b978-044481714-3/50018-7 · Cited by 46
Minimal model semantics for nonmonotonic modal logics
Schwarz, G. F. (2003) · ACM/IEEE Symposium on Logic in Computer Science (LICS) · doi:10.1109/lics.1992.185517 · Cited by 46
Disjunctive LP+integrity constraints= stable model semantics
Fern�ndez, J. A., Lobo, J., Minker, J., & Subrahmanian, V. S. (1993) · Annals of Mathematics and Artificial Intelligence · doi:10.1007/bf01530802 · Cited by 46
Brave induction: a logical framework for learning from incomplete information
Sakama, C., & Inoue, K. (2009) · Machine Learning · doi:10.1007/s10994-009-5113-y · Cited by 47
Epistemic Semantics for Fixed-Points Non-Monotonic Logics
Lin, F., & Shoham, Y. (1990) · Theoretical Aspects of Rationality and Knowledge · Cited by 45
An inclusion theorem for defeasible logics
Billington, D. P., Antoniou, G., Guido Governatori, A., & Maher, M. J. (2010) · ACM Transactions on Computational Logic · doi:10.1145/1838552.1838558 · Cited by 45
On the complexity of propositional knowledge base revision, updates, and counterfactuals
Eiter, T., & Gottlob, G. (1992) · ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (PODS) · doi:10.1145/137097.137886 · Cited by 45
Relating default logic and circumscription
Etherington, D. W. (1987) · International Joint Conference on Artificial Intelligence · Cited by 45
Miracles in formal theories of action
Lifschitz, V., & Rabinov, A. (1989) · Artificial Intelligence · doi:10.1016/0004-3702(89)90059-3 · Cited by 45
A Note on the Rational Closure of Knowledge Bases with Both Positive and Negative Knowledge
Booth, R., & Paris, J. B. (1998) · Journal of Logic Language and Information · doi:10.1023/a:1008261123028 · Cited by 44
Towards a mental probability logic
Pfeifer, N., & Kleiter, G. D. (2005) · Psychologica Belgica · doi:10.5334/pb-45-1-71 · Cited by 44
Eliminating the fixed predicates from a circumscription
de Kleer, J., & Konolige, K. (1989) · Artificial Intelligence · doi:10.1016/0004-3702(89)90018-0 · Cited by 44
Reasoning under incomplete information in Artificial Intelligence: A comparison of formalisms using a single example
Besnard, P., Cordier, M.-O., Didier Dubois, A., Froidevaux, C., Moinard, Y., Prade, H. M., Schwind, C. B., Siegel, P., & del Cerro, L. F. (1990) · HAL · Cited by 44
Bottom-up computation of perfect models for disjunctive theories
Fernández, J. A., & Minker, J. (1995) · The Journal of Logic Programming · doi:10.1016/0743-1066(94)00106-g · Cited by 44
Toward an alternative notion of information systems ontologies: Information engineering as a hermeneutic enterprise
Fonseca, F., & Martin, J. E. (2004) · Journal of the American Society for Information Science and Technology · doi:10.1002/asi.20099 · Cited by 43
Everyday reasoning and logical inference
Barwise, J. (1993) · Behavioral and Brain Sciences · doi:10.1017/s0140525x00030314 · Cited by 43
Well-founded and stationary models of logic programs
Przymusiński, T. C. (1994) · Annals of Mathematics and Artificial Intelligence · doi:10.1007/bf01530784 · Cited by 43
Mental models and the tractability of everyday reasoning
Oaksford, M. (1993) · Behavioral and Brain Sciences · doi:10.1017/s0140525x00030569 · Cited by 43
A semantics for default logic
Etherington, D. W. (1987) · International Joint Conference on Artificial Intelligence · Cited by 43
Generically free choice
Nickel, B. (2010) · Linguistics and Philosophy · doi:10.1007/s10988-011-9087-4 · Cited by 42
Impacts of artificial intelligence
Boden, M. A. (1984) · Futures · doi:10.1016/0016-3287(84)90007-7 · Cited by 42
Circumscriptive theories: A logic-based framework for knowledge representation
Lifschitz, V. (1988) · Journal of Philosophical Logic · doi:10.1007/bf00297512 · Cited by 42
Complexity and undecidability results for logic programming
Schlipf, J. S. (1995) · Annals of Mathematics and Artificial Intelligence · doi:10.1007/bf01536398 · Cited by 42
On compact representations of propositional circumscription
Cadoli, M., Donini, F. M., Schaerf, M., & Silvestri, R. (1997) · Theoretical Computer Science · doi:10.1016/s0304-3975(96)00182-x · Cited by 42
There Is Hope After All: Quantifying Opinion and Trustworthiness in Neural Networks
Cheng, M., Nazarian, S., & Bogdan, P. (2020) · Frontiers in Artificial Intelligence · doi:10.3389/frai.2020.00054 · Cited by 41
Semantic Matchmaking of Web Resources with Local Closed-World Reasoning
Grimm, S., & Hitzler, P. (2007) · International Journal of Electronic Commerce · doi:10.2753/jec1086-4415120204 · Cited by 41
A new algorithm for incremental prime implicate generation
Ngair, T.-H. (1993) · International Joint Conference on Artificial Intelligence · Cited by 41
A Logic for Characterizing Multiple Bounded Agents
Grant, J., Kraus, S., & Perlis, D. R. (2000) · Autonomous Agents and Multi-Agent Systems · doi:10.1023/a:1010050603219 · Cited by 41
Visual Event Classification via Force Dynamics
Siskind, J. M. (2000) · Cited by 41
Intuitionistic basis for non-monotonic logic
Gabbay, D. M. (2005) · Springer eBooks · doi:10.1007/bfb0000064 · Cited by 41
Tableaux and sequent calculus for minimal entailment
Olivetti, N. (1992) · Journal of Automated Reasoning · doi:10.1007/bf00247828 · Cited by 41
Modelling ethical rules of lying with Answer Set Programming
Ganascia, J. (2007) · Ethics and Information Technology · doi:10.1007/s10676-006-9134-y · Cited by 44

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