Applications of Circumscription to Formalizing Common Sense Knowledge
By John McCarthy. 1987
Subfields: Knowledge Graphs & Representation
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Knowledge Graphs & Representation
- Murray Shanahan
- Raymond Reiter
- Peter Clark
- Oyvind Tafjord
- D. Benjamin
- Van Durme
- Bhavana Dalvi
- Ilkka Niemelä
Citations in the corpus
- Transformers as Soft Reasoners over Language (2020, background): “The two test datasets are as follows: Birds The “birds” rulebase is a well-known logic problem illustrating the use of “abnormality” predicates [ McCarthy, 1984 ] .”
- ProofWriter: Generating Implications, Proofs, and Abductive Statements over Natural Language (2020, background): “The RuleTaker “birds” rulebase is a well-known logic problem illustrating the use of “abnormal-ity” predicates (McCarthy, 1984), 7 , and converted into English by hand.”
- Extracting implicit knowledge from text (2009, background): “As an aside, note the relationship between that soft restriction, the k-constrained conditional probabilities here, and the use of an abnormality predicate when performing circumscription (McCarthy, 1980, 1986). McCarthy (1986) wrote: Nonmonotonic”
- Perception as Abduction: Turning Sensor Data Into Meaningful Representation (2005, methodology): “The frame problem is overcome using circumscription (Lifschitz, 1994; McCarthy, 1986).”
- A Theory of Diagnosis from First Principles (1986, methodology): “The use of an AB predicate for system descriptions is borrowed from McCarthy [11] who exploits such a predicate in conjunction with his formalization of circumscription to account for various patterns of nonmonotonic common-sense reasoning.”
- Nonmonotonic causal theories (2004, background): “This work has led to the emergence of several formal theories of nonmonotonic reasoning, including circumscription [28] [29] and default logic [36].”
- Extending and implementing the stable model semantics (2000, background): “The stable model semantics is a form of nonmonotonic reasoning that is closely related to the default logic of Reiter [52, 35], circumscription of Mc-Carthy [37, 38 , 32], and the autoepistemic logic of Moore [39, 21].”
- Answer Set Solving in Practice (2012, background): “(2005), Mellarkod and Gelfond (2008), Mellarkod et al.”
- Generality in artificial intelligence (1987, methodology): “(McCarthy 1986) indicates how to handle this using circumscription , but Lifschitz (1985) has shown that circumscription needs to be improved and has made proposals for this.”