Name
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. |
Year | DOI | Venue |
|---|---|---|
1996 | 10.1109/TAI.1996.560479 | ICTAI |
Keywords | Field | DocType |
acyclic graph,nonmonotonic multiple inheritance scheme,fast verification,transitive closure compression technique,artificial intelligence,multiple inheritance scheme,fast algorithm,transitive relationship,nonmontonic transitive relationships,efficient algorithm,efficient representation,nonmonotonic reasoning,satisfiability,directed graphs,artificial intelligent,directed acyclic graph,multiple inheritance,knowledge representation,spanning tree,transitive closure | Transitive reduction,Computer science,Directed graph,Algorithm,Directed acyclic graph,Artificial intelligence,Spanning tree,Hierarchy,Transitive closure,Machine learning,Transitive relation,Multiple inheritance | Conference |
ISSN | ISBN | Citations |
1082-3409 | 0-8186-7686-8 | 1 |
PageRank | References | Authors |
0.38 | 0 | 1 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| B. Boutsinas | 1 | 82 | 5.59 |