Premium
Defeasible Inheritance Through Specialization[Note 1. Address correspondence to Ekawit Nantajeewarawat at the Department of ...]
Author(s) -
Nantajeewarawat Ekawit,
Wuwongse Vilas
Publication year - 2001
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/0824-7935.00134
Subject(s) - inheritance (genetic algorithm) , defeasible estate , semantics (computer science) , computer science , multiple inheritance , theoretical computer science , programming language , artificial intelligence , biology , genetics , object oriented programming , gene
Typed substitution provides a means of capturing inheritance in logic deduction systems. However, in the presence of method overriding and multiple inheritance, inheritance is known to be nonmonotonic, and the semantics of programs becomes a problematic issue. This article attempts to provide a general framework, based on Dung's argumentation theoretic framework, for developing a natural semantics for programs with dynamic nonmonotonic inheritance. The relationship between the presented semantics and perfect‐model (with overriding) semantics, proposed by Dobbie and Topor (1995), is investigated. It is shown that for inheritance‐stratified programs, the two semantics coincide. However, the proposed semantics also provides correct skeptical meanings for the programs that are not inheritance‐stratified.