Sandewall, Erik 2010 (English)In: Artificial Intelligence, ISSN 0004-3702, E-ISSN 0374-2539, Vol. 174, no 18, 1431-1459Article in journal (Refereed) Published
This article introduces and uses a representation of defeasible inheritance networks where links in the network are viewed as propositions, and where defeasible links are tagged with a quantitative indication of the proportion of exceptions, called the doubt index. This doubt index is used for restricting the length of the chains of inference. The representation also introduces the use of defeater literals that disable the chaining of subsumption links. The use of defeater literals replaces the use of negative defeasible inheritance links, expressing "most A are not B". The new representation improves the expressivity significantly. Inference in inheritance networks is defined by a combination of axioms that constrain the contents of network extensions, a heuristic restriction that also has that effect, and a nonmonotonic operation of minimizing the set of defeater literals while retaining consistency. We introduce an underlying semantics that defines the meaning of literals in a network, and prove that the axioms are sound with respect to this semantics. We also discuss the conditions for obtaining completeness. Traditional concepts, assumptions and issues in research on nonmonotonic or defeasible inheritance are reviewed in the perspective of this approach.
Defeasible inheritance, Multiple inheritance with exceptions, Nonmonotonic logic, Underlying semantics
National CategoryEngineering and Technology
Identifiersurn:nbn:se:liu:diva-63403 (URN)10.1016/j.artint.2010.09.001 (DOI)000284667900001 (ISI)oai:DiVA.org:liu-63403 (OAI)diva2:379122 (DiVA)