Abstract
In common sense reasoning two typical types of defaults are encountered. One is of the form “All birds can fly exceptb 1,b 2,…, andb m (m≥1)”, and the other “All birds can fly, but there exist exceptions”. The first type of defaults is readily formalized but the other, as some researchers have noticed, is difficult to deal with. This paper establishes a general scheme for formalizing defaults of the two types, the key to which is the introduction of a two-argument predicateab(I, S) to represent exceptional object.
Similar content being viewed by others
Explore related subjects
Discover the latest articles, news and stories from top researchers in related subjects.References
McCarthy J. Applications of circumscription to formalizing common-sense knowledge.Artificial Intelligence, 1986, 28: 89–116.
McCarthy J. Circumscription — A form of non-monotonic reasoning.Artificial Intelligence, 1980, 13: 27–39.
Lifschitz V. Pointwise circumscription. InProc. AAAI-86, Philadelphia, PA, 1986, pp.406–410.
Reiter R. A logic for default reasoning.Artificial Intelligence, 1980, 13: 81–132.
Moore R. Semantic considerations on nonmonotonic logic.Artificial Intelligence, 1986, 25: 79–94.
Perlis D. On the consistency of common sense reasoning.Computational Intelligence, 1980, 2: 180–190.
Poole D. What the lottery paradox tells us about nonmonotonic reasoning. InProc. the 1st International Conference on Knowledge Representation and Reasoning, Toronto, Ontario, 1989, pp.333–340.
Etherington D, Kraus S, Perlis D. Nonmonotonicity and the scope of reasoning.Artificial Intelligence, 1991, 52: 221–261.
Reiter R. A theory of diagnosis from first principles.Artificial Intelligence, 1987, 32: 57–95.
Author information
Authors and Affiliations
Corresponding author
Additional information
Project partly supported by the National Natural Science Foundation, Sichuan Youth Science and Technology Foundation, and Foundation of the State Education Commission of China.
SHEN Yidong is a Professor of computer science at Chongqing University. He received his Ph.D. degree in computer science from Chongqing University in 1991. He was a visiting researcher at the University of Valenciennes, France (1992–1993), the Institute for Advanced Computer Studies, University of Maryland, USA (1995–1996), and the Department of Computing Science, University of Alberta, Canada (1998–1999). His research interests include artificial intelligence, deductive and object-oriented dtabases, logic programming and parallel processing.
Rights and permissions
About this article
Cite this article
Shen, Y. A general scheme for formalizing defaults using the predicateab(I, S) . J. Comput. Sci. & Technol. 14, 159–164 (1999). https://doi.org/10.1007/BF02946523
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF02946523