LATPub257: Unterschied zwischen den Versionen
Aus International Center for Computational Logic
Marcel Lippmann (Diskussion | Beiträge) KKeine Bearbeitungszusammenfassung |
Marcel Lippmann (Diskussion | Beiträge) KKeine Bearbeitungszusammenfassung |
||
| Zeile 20: | Zeile 20: | ||
}} | }} | ||
{{Publikation Details | {{Publikation Details | ||
|Abstract=We present a translation of looping alternating two-way automata into a | |Abstract=We present a translation of looping alternating two-way automata into a comparably inexpressive description logic, which is contained in SHIQ. This enables us to perform the emptiness test for a language accepted by such an automaton using the systems FaCT and RACER. We implemented our translation and performed a test using automata which accept models for ALCIO concepts, so that we can use SHIQ systems to reason about nominals. Our empirical results show, however, that the resulting knowledge bases are hard to process for both systems. | ||
comparably inexpressive description logic, which is contained in SHIQ. This | |||
enables us to perform the emptiness test for a language accepted by such an | |||
automaton using the systems FaCT and RACER. We implemented our translation | |||
and performed a test using automata which accept models for ALCIO concepts, | |||
so that we can use SHIQ systems to reason about nominals. Our empirical | |||
results show, however, that the resulting knowledge bases are hard to | |||
process for both systems. | |||
|ISBN= | |ISBN= | ||
|ISSN= | |ISSN= | ||
| Zeile 44: | Zeile 36: | ||
year = {2003}, | year = {2003}, | ||
} | } | ||
}} | }} | ||
Version vom 23. März 2015, 13:24 Uhr
Reasoning about Nominals with FaCT and RACER
Jan HladikJan Hladik
Jan Hladik
Reasoning about Nominals with FaCT and RACER
Proceedings of the 2003 International Workshop on Description Logics (DL2003), CEUR-WS, 2003
Reasoning about Nominals with FaCT and RACER
Proceedings of the 2003 International Workshop on Description Logics (DL2003), CEUR-WS, 2003
- KurzfassungAbstract
We present a translation of looping alternating two-way automata into a comparably inexpressive description logic, which is contained in SHIQ. This enables us to perform the emptiness test for a language accepted by such an automaton using the systems FaCT and RACER. We implemented our translation and performed a test using automata which accept models for ALCIO concepts, so that we can use SHIQ systems to reason about nominals. Our empirical results show, however, that the resulting knowledge bases are hard to process for both systems. - Forschungsgruppe:Research Group: AutomatentheorieAutomata Theory
@inproceedings{ Hladik-DL-2003,
author = {Jan {Hladik}},
booktitle = {Proceedings of the 2003 International Workshop on Description Logics ({DL2003})},
series = {CEUR-WS},
title = {Reasoning about Nominals with {FaCT} and {RACER}},
year = {2003},
}
