Characterizing the semantics of terminological cycles with the help of finite automata
From International Center for Computational Logic
Characterizing the semantics of terminological cycles with the help of finite automata
R. KüstersR. Küsters
R. Küsters
Characterizing the semantics of terminological cycles with the help of finite automata
Proceedings of the International Workshop on Description Logics, DL'97, 10-14, 1997. LRI, Universitè PARIS-SUD, Cente d'Orsay
Characterizing the semantics of terminological cycles with the help of finite automata
Proceedings of the International Workshop on Description Logics, DL'97, 10-14, 1997. LRI, Universitè PARIS-SUD, Cente d'Orsay
- KurzfassungAbstract
The representation of terminological knowledge may naturally lead to terminological cycles. In addition to descriptive semantics, the meaning of cyclic terminologies can also be captured by fixed-point semantics. To gain a more profound understanding of these semantics and to obtain inference algorithms for inconsistency, subsumption, and related inference tasks, this paper provides automata theoretic characterizations of these semantics. The already existing results for the language FL_0 are extended to ALN, which additionally allows for primitive negation and number-restrictions. Moreover, this work considers the relationship between certain schemas and ALN-terminologies. - Forschungsgruppe:Research Group: AutomatentheorieAutomata Theory
@inproceedings{ Kuesters-DL-97,
author = {R. {K{\"u}sters}},
booktitle = {Proceedings of the International Workshop on Description Logics, {DL'97}},
pages = {10--14},
publisher = {LRI, Universit\`e PARIS-SUD, Cente d'Orsay},
title = {Characterizing the semantics of terminological cycles with the help of finite automata},
year = {1997},
}
