Efficient representation of knowledge, under a multiple inheritance scheme with exceptions, plays an important role in artificial intelligence. Fast verification of the existence of a transitive relationship in such a hierarchy is of great importance. This paper presents an efficient algorithm for computing transitive relationships with exceptions. It is based on a known transitive closure compression technique that uses a labeled spanning tree of a directed acyclic graph. It is a very fast algorithm compared to graph-search algorithms that solve the same problem, without sacrificing some desirable properties that nonmonotonic multiple inheritance schemes should, in general, possess. Moreover it satisfies low storage requirements.
{"title":"On managing nonmonotonic transitive relationships","authors":"B. Boutsinas","doi":"10.1109/TAI.1996.560479","DOIUrl":"https://doi.org/10.1109/TAI.1996.560479","url":null,"abstract":"Efficient representation of knowledge, under a multiple inheritance scheme with exceptions, plays an important role in artificial intelligence. Fast verification of the existence of a transitive relationship in such a hierarchy is of great importance. This paper presents an efficient algorithm for computing transitive relationships with exceptions. It is based on a known transitive closure compression technique that uses a labeled spanning tree of a directed acyclic graph. It is a very fast algorithm compared to graph-search algorithms that solve the same problem, without sacrificing some desirable properties that nonmonotonic multiple inheritance schemes should, in general, possess. Moreover it satisfies low storage requirements.","PeriodicalId":209171,"journal":{"name":"Proceedings Eighth IEEE International Conference on Tools with Artificial Intelligence","volume":"76 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-11-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115215920","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：