Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Defeasible inheritance with doubt index and its axiomatic characterization
KTH, School of Education and Communication in Engineering Science (ECE), Department for Library services, Language and ARC, Publication Infrastructure.
2010 (English)In: Artificial Intelligence, ISSN 0004-3702, E-ISSN 1872-7921, Vol. 174, no 18, 1431-1459 p.Article in journal (Refereed) Published
Abstract [en]

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.

Place, publisher, year, edition, pages
2010. Vol. 174, no 18, 1431-1459 p.
Keyword [en]
Defeasible inheritance, Multiple inheritance with exceptions, Nonmonotonic logic, Underlying semantics
National Category
Computer and Information Science
Identifiers
URN: urn:nbn:se:kth:diva-27692DOI: 10.1016/j.artint.2010.09.001ISI: 000284667900001Scopus ID: 2-s2.0-78049290381OAI: oai:DiVA.org:kth-27692DiVA: diva2:380268
Note

QC 20120418

Available from: 2010-12-21 Created: 2010-12-20 Last updated: 2017-12-11Bibliographically approved

Open Access in DiVA

No full text

Other links

Publisher's full textScopus

Search in DiVA

By author/editor
Sandewall, Erik
By organisation
Publication Infrastructure
In the same journal
Artificial Intelligence
Computer and Information Science

Search outside of DiVA

GoogleGoogle Scholar

doi
urn-nbn

Altmetric score

doi
urn-nbn
Total: 55 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf