Inproceedings1829: Unterschied zwischen den Versionen
K (Added from ontology) |
K (Wikipedia python library) |
||
Zeile 29: | Zeile 29: | ||
|DOI Name= | |DOI Name= | ||
|Projekt=ReaSem, NeOn, Active, | |Projekt=ReaSem, NeOn, Active, | ||
− | |Forschungsgruppe= | + | |Forschungsgruppe=Wissensmanagement |
}} | }} | ||
{{Forschungsgebiet Auswahl | {{Forschungsgebiet Auswahl |
Aktuelle Version vom 16. Oktober 2009, 23:00 Uhr
ELP: Tractable Rules for OWL 2
ELP: Tractable Rules for OWL 2
Published: 2008
Oktober
Herausgeber: Amit Sheth and Steffen Staab and Mike Dean and Massimo Paolucci and Diana Maynard and Timothy Finin and Krishnaprasad Thirunarayan
Buchtitel: Proceedings of the 7th International Semantic Web Conference (ISWC 2008)
Ausgabe: 5318
Reihe: LNCS
Seiten: 649-664
Verlag: Springer
Referierte Veröffentlichung
BibTeX
Kurzfassung
We introduce ELP as a decidable fragment of the Semantic Web Rule Language (SWRL) that admits reasoning in polynomial time. ELP is based on the tractable description logic EL++, and encompasses an extended notion of the recently proposed DL rules for that logic. Thus ELP extends EL++ with a number of features introduced by the forthcoming OWL 2, such as disjoint roles, local reflexivity, certain range restrictions, and the universal role. We present a reasoning algorithm based on a translation of ELP to Datalog, and this translation also enables the seamless integration of DL-safe rules into ELP. While reasoning with DL-safe rules as such is already highly intractable, we show that DL-safe rules based on the Description Logic Programming (DLP) fragment of OWL 2 can be admitted in ELP without losing tractability.
Weitere Informationen unter: Link, Link, Link
Wissensrepräsentationssprachen, Beschreibungslogik, Komplexitätstheorie, Logik, Logikprogrammierung, Semantic Web