Premium
ON THE SEMANTICS OF STABLE INHERITANCE REASONING
Author(s) -
Boutilier Craig
Publication year - 1993
Publication title -
computational intelligence
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.353
H-Index - 52
eISSN - 1467-8640
pISSN - 0824-7935
DOI - 10.1111/j.1467-8640.1993.tb00302.x
Subject(s) - inference , inheritance (genetic algorithm) , computer science , artificial intelligence , argument (complex analysis) , semantics (computer science) , rule of inference , key (lock) , theoretical computer science , modus ponens , natural language processing , cognitive science , programming language , psychology , biochemistry , chemistry , computer security , gene
Inheritance reasoners have traditionally been viewed as argument systems, or algorithms that determine reasonable conclusions by constructing acceptable arguments. While the intended meaning of links in such networks is understood, formal semantic accounts are troublesome, as are semantic accounts of the inference process. We adopt a different perspective, suggesting that links be interpreted as conditional sentences with appropriate truth conditions rather than uninterpreted “reasons.” The conditional logic CT4D is used for this purpose. Furthermore, we characterize inference in our networks in terms of preferred (or minimal) models. In the process, we identify some key differences between our account of inference and those based on the notion of inferential distance, specifically with respect to the stability of reasoning. Key words: nonmonotonic reasoning, inheritance hierarchies, minimal models, conditional logic.