On principles and problems of defeasible inheritance

We have two aims here: First, to discuss some basic principles underlying different approaches to Defeasible Inheritance; second, to examine problems of these approaches as they already appear in quite simple diagrams. We build upon, but go beyond, the discussion in the joint paper of Touretzky, Horty, and Thomason: A Clash of Intuitions

Wright State University College of Engineering and Computer Science Bits and PCs newsletter, October 1989

A fourteen page newsletter created by the Wright State University College of Engineering and Computer Science that addresses the current affairs of the college.https://corescholar.libraries.wright.edu/bits_pcs/1006/thumbnail.jp

Wright State University College of Engineering and Computer Science Bits and PCs newsletter, October 1989

A fourteen page newsletter created by the Wright State University College of Engineering and Computer Science that addresses the current affairs of the college.https://corescholar.libraries.wright.edu/bits_pcs/1006/thumbnail.jp

Defeasible inheritance systems and reactive diagrams

We give an analysis of defeasible inheritance diagrams, also from the perspective of reactive diagrams

Logical tools for handling change in agent-based systems

We give a unified approach to various results and problems of nonclassical logic

An Evidence-based Framework for a Theory of Inheritance

We present an approach to formalizing nonmonotonic multiple inheritance networks by combining concepts from logic programming and multi-valued logics in a uniform framework. A Horn-clause logic language is used for specifying inheritance networks. This allows a natural representation of class-subclass hierarchies and ambiguous inheritance networks. It also provides means for resolving ambiguities resulting from the network topology, but which are not inherent to the problem. We provide a model theory for the language and show how a unique intended model can be associated with every inheritance network. This model resembles the unique extension obtained in the skeptical theory of inheritance [Hor-87], but is more general. Finally, we present an algorithm which realizes the aforementioned semantics

An Evidence-based Framework for a Theory of Inheritance

We present an approach to formalizing nonmonotonic multiple inheritance networks by combining concepts from logic programming and multi-valued logics in a uniform framework. A Horn-clause logic language is used for specifying inheritance networks. This allows a natural representation of class-subclass hierarchies and ambiguous inheritance networks. It also provides means for resolving ambiguities resulting from the network topology, but which are not inherent to the problem. We provide a model theory for the language and show how a unique intended model can be associated with every inheritance network. This model resembles the unique extension obtained in the skeptical theory of inheritance [Hor-87], but is more general. Finally, we present an algorithm which realizes the aforementioned semantics

An Evidence-based Framework for a Theory of Inheritance

We present an approach to formalizing nonmonotonic multiple inheritance networks by combining concepts from logic programming and multi-valued logics in a uniform framework. A Horn-clause logic language is used for specifying inheritance networks. This allows a natural representation of class-subclass hierarchies and ambiguous inheritance networks. It also provides means for resolving ambiguities resulting from the network topology, but which are not inherent to the problem. We provide a model theory for the language and show how a unique intended model can be associated with every inheritance network. This model resembles the unique extension obtained in the skeptical theory of inheritance [Hor-87], but is more general. Finally, we present an algorithm which realizes the aforementioned semantics.