Computing Reviews
Today's Issue Hot Topics Search Browse Recommended My Account Log In
Review Help
Search
A tutorial on default logics
Antoniou G. ACM Computing Surveys31 (4):337-359,1999.Type:Article
Date Reviewed: Jun 1 2000

Antoniou continues the generally excellent series of surveys published by the ACM for over 30 years. Each is intended for upper-level undergraduates or beginning graduate students, and describes a particular area of computer science. This tutorial focuses on the basic concepts of default reasoning, which is the logic that applies to a system that has only incomplete information at hand, and where plausible conjectures called defaults are added to the premises being assumed. If new information later becomes available, the default and any conclusions depending on its use may be retracted. Such a system is nonmonotonic. That is, if a statement s follows from a set of premises M, and M ⊆ M′, then s does not necessarily follow from M′. Only a general familiarity with the predicate calculus is assumed. The monograph is based on work beginning with that of  Reiter  (1980), continuing through Lukaszewicz (1988–90), and ending with the Rational Default Logic of Mikitiuk and  Trusczynski  (1995). A 1996 paper of Engelfriet and Treur on the semantics of default logics is included in the excellent reference list, but statement meanings are not discussed in this tutorial.

A simple example neatly explains the difference between a default logic and classical logic (p. 339). Default logic uses whereas classical has football ∧ ⌝ snow → takesPlace . In the first rule, ⌝ snow is used as a default, whereas in the second, it is a fact. Classical reasoning would prohibit any football games from being scheduled unless it were “proven” that there would be no snow, while using a default allows games to be listed assuming that there will be no snow. Although this example was well chosen, others are old chestnuts, such as the bird (tweety) series.

I was disappointed by the lack of motivation for using default logics in real-world situations, such as databases, law, and medicine, as the author claims. The tweety example is not sufficient. The author states that the purpose of this tutorial is to contribute to “the understanding of the basic concepts” (p. 358), and he refers readers to specific references discussing implementations. He notes that default reasoning has proven difficult for students at the University of Toronto to understand. I believe that the inclusion of better examples would have helped.

Reviewer:  D. Appleby Review #: CR123023
Bookmark and Share
 
Nonmonotonic Reasoning And Belief Revision (I.2.3 ... )
 
 
Representation Languages (I.2.4 ... )
 
Would you recommend this review?
yes
no
Other reviews under "Nonmonotonic Reasoning And Belief Revision": Date
On the justification of Dempster’s rule of combination
Voorbraak F. Artificial Intelligence 48(2): 171-197, 1991. Type: Article
Mar 1 1992
Nonmonotonic reasoning
Brewka G. (ed), Cambridge University Press, New York, NY, 1991. Type: Book (9780521383943)
Oct 1 1992
Nonmonotonic reasoning in the framework of situation calculus
Baker A. Artificial Intelligence 49(1-3): 5-23, 1991. Type: Article
Oct 1 1992
more...

E-Mail This Printer-Friendly
Send Your Comments
Contact Us
Reproduction in whole or in part without permission is prohibited.   Copyright 1999-2024 ThinkLoud®
Terms of Use
| Privacy Policy