LATPub188: 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 6: | Zeile 6: | ||
{{Inproceedings | {{Inproceedings | ||
|Referiert=1 | |Referiert=1 | ||
|Title=Implementing the n-ary Description Logic | |Title=Implementing the n-ary Description Logic GF1- | ||
|Year=2000 | |Year=2000 | ||
|Month= | |Month= | ||
|Booktitle=Proceedings of the International Workshop in Description Logics 2000 | |Booktitle=Proceedings of the International Workshop in Description Logics 2000 (DL2000) | ||
|Editor= | |Editor= | ||
|Note= | |Note= | ||
Version vom 20. März 2015, 16:28 Uhr
Implementing the n-ary Description Logic GF1-
Jan HladikJan Hladik
Jan Hladik
Implementing the n-ary Description Logic GF1-
Proceedings of the International Workshop in Description Logics 2000 (DL2000), 2000
Implementing the n-ary Description Logic GF1-
Proceedings of the International Workshop in Description Logics 2000 (DL2000), 2000
- KurzfassungAbstract
GF1- is a description logic allowing for n-ary relations, for whichsatisfiability is decidable in PSPACE. In this paper, the implementation and optimization of a tableau algorithm deciding GF1- are presented, and the
performance is compared with that of other solvers. - Forschungsgruppe:Research Group: AutomatentheorieAutomata Theory
@inproceedings{ Hladik-DL-2000,
address = {Aachen, Germany},
author = {Jan {Hladik}},
booktitle = {Proceedings of the International Workshop in Description Logics 2000 {(DL2000)}},
title = {Implementing the n-ary Description Logic {GF1-}},
year = {2000},
}
