On the equivalence of upward and downward inheritance reasoners | Zendy

Krishnaprasad Thirunarayan | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

On the equivalence of upward and downward inheritance reasoners

Author(s) -

Krishnaprasad Thirunarayan

Publication year - 1995

Publication title -

annals of mathematics and artificial intelligence

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.369

H-Index - 55

eISSN - 1573-7470

pISSN - 1012-2443

DOI - 10.1007/bf01534457

Subject(s) - inheritance (genetic algorithm) , equivalence (formal languages) , computer science , theoretical computer science , abstraction , property (philosophy) , divergence (linguistics) , expressive power , simple (philosophy) , resolution (logic) , interpretation (philosophy) , tree (set theory) , mathematics , artificial intelligence , epistemology , discrete mathematics , linguistics , combinatorics , biochemistry , chemistry , philosophy , gene , programming language

In this paper, we analyze systematically the downward (property flow) and the upward (individual flow) views of inheritance for different categories of inheritance networks. We observe that both these views assign the same meaning to tree-structured hierarchies, and explain the divergence in the interpretation of more general networks in terms of their expressive power. This simple analysis sheds light on the inherent nature of nonmonotonic inheritance and can form the basis for the design of efficient algorithms for certain classes of queries. In addition, we describe the notion of preferential inheritance to specify additional conflict resolution information that can be integrated smoothly with the upward view of inheritance.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research