Denotational semantics: a methodology for language development
Denotational semantics: a methodology for language development
Foundations of logic programming; (2nd extended ed.)
Foundations of logic programming; (2nd extended ed.)
The complementation problem for Bu¨chi automata with applications to temporal logic
Theoretical Computer Science
Recursive query processing: the power of logic
Theoretical Computer Science
Automata, Languages, and Machines
Automata, Languages, and Machines
Introduction to Mathematical Theory of Computation
Introduction to Mathematical Theory of Computation
Universality of data retrieval languages
POPL '79 Proceedings of the 6th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
The complexity of relational query languages (Extended Abstract)
STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
Relational queries computable in polynomial time (Extended Abstract)
STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
An essential hybrid reasoning system: knowledge and symbol level accounts of KRYPTON
IJCAI'85 Proceedings of the 9th international joint conference on Artificial intelligence - Volume 1
ShareAlike your data: self-referential usage policies for the semantic web
ISWC'11 Proceedings of the 10th international conference on The semantic web - Volume Part I
| Hi-index | 0.00 |
Cyclic definitions are often prohibited in terminological knowledge representation languages because, from a theoretical point of view, their semantics is not clear and, from a practical point of view, existing inference algorithms may go astray in the presence of cycles. In this paper, we shall consider terminological cycles in a very small KL-ONE-based language. For this language, the effect of the three types of semantics introduced by (Nebel 1987,1989,1989a) can be completely described with the help of finite automata. These descriptions provide a rather intuitive understanding of terminologies with cyclic definitions and give insight into the essential features of the respective semantics. In addition, one obtains algorithms and complexity results for subsumption determination. As it stands, the greatest fixed-point semantics comes off best. The characterization of this semantics is easy and has an obvious intuitive interpretation. Furthermore, important constructs - such as value-restriction with respect to the transitive or reflexive-transitive closure of a role - can easily be expressed.