On Inheritance Hierarchies With Exceptions
نویسندگان
چکیده
Using default logic, we formalize NETL-like inheritance hierarchies with exceptions. This provides a number of benefits: (1) A precise semantics for such hierarchies. (2) A provably correct (with respect to the proof theory of default logic) inference algorithm for acyclic networks. (3) A guarantee that acyclic networks have extensions. (4) A provably correct quasi-parallel inference algorithm for such networks.
منابع مشابه
More on Inheritance Hierarchies with Exceptions: Default Theories and Inferential Distance
In Artificial Intelligence, well-understood reasoning systems and tractable reasoning systems have often seemed mutually exclusive. This has been exemplified by nonmonotonic reasoning formalisms and inheritance-with-exceptions reasoners. These have epitomized the two extremes: the former not even semidecidable, the latter completely ad hoc. We previously presented a formal mechanism for specify...
متن کاملThe Tractability of Path-Based Inheritance
Touretzky (1984) proposed a formalism for nonmonotonic multiple inheritance reasoning which is sound in the presence of ambiguities and redundant links. We show that Touret-zky's inheritance notion is NP-hard, and thus, provided P#NP, computationally intractable. This result holds even when one only considers unambiguous, totally acyclic inheritance net works. A direct consequence of this resu...
متن کاملThe Case for Explicit Exceptions
Most of the work on inheritance hierarchies in recent years has had as its goal the design of general purpose algorithms that depend only on the topology of the inheritance network. This research has produced some important observations about the various strategies used in human common sense reasoning, but it has also produced a proliferation of incompatible systems. In this paper, we resurrect...
متن کاملParallelism in Inheritance Hierarchies with Exceptions
In a recent paper, Etherington & Reiter formalized a simple version of semantic networks with exceptions in terms of Reiter's Default Logic. With this approach they were able to formally characterize the correctness of an inference algorithm in terms of Default Logic, and exhibited an algorithm that was correct in this sense. Finally, they concluded that massively parallel architectures for sem...
متن کاملEfficient approach for restructuring multiple inheritance hierarchies
This paper discusses the restructuring of inheritance hierarchies of classes and introduces a method of restructuring multiple hierarchies of class inheritance, which removes duplicated methods and creates inheritance hierarchies without overridden methods while preserving the behavior of objects. This paper formulates a restructuring problem for 0–1 integer programming and presents a network-b...
متن کامل