Defeasible Inheritance Through Specialization
Defeasible Inheritance Through Specialization
复制标题
通过专业化可取消继承
DOI：
10.1111/0824-7935.00134
复制
发表时间：
2001
影响因子：
2.8
通讯作者：
V. Wuwongse
中科院分区：
文献类型：
--
作者：
Ekawit Nantajeewarawat;V. Wuwongse
类型替换提供了一种在逻辑演绎系统中捕获继承的方法。然而，在存在方法重写和多重继承的情况下，继承被认为是非单调的，并且程序的语义成为一个有问题的问题。本文试图提供一个基于 Dung 论证理论框架的通用框架，用于为具有动态非单调继承的程序开发自然语义。研究了 Dobbie 和 Topor (1995) 提出的所呈现的语义和完美模型（具有重写）语义之间的关系。结果表明，对于继承分层程序，这两种语义是一致的。然而，所提出的语义也为非继承分层的程序提供了正确的怀疑意义。
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.