Inproceedings3080: Unterschied zwischen den Versionen
Aus International Center for Computational Logic
Markus Krötzsch (Diskussion | Beiträge) K (Textersetzung - „Forschungsgebiet=Beschreibungslogik }}“ durch „Forschungsgebiet=Beschreibungslogiken }}“) |
Markus Krötzsch (Diskussion | Beiträge) Keine Bearbeitungszusammenfassung |
||
| Zeile 5: | Zeile 5: | ||
{{Inproceedings | {{Inproceedings | ||
|Referiert=1 | |Referiert=1 | ||
|Title=Efficient Inferencing for OWL EL | |Title=Efficient Inferencing for OWL EL | ||
|To appear=0 | |||
|Year=2010 | |Year=2010 | ||
|Booktitle=Proceedings of the 12th European Confernce on Logics in Artificial Intelligence (JELIA'10) | |Booktitle=Proceedings of the 12th European Confernce on Logics in Artificial Intelligence (JELIA'10) | ||
|Pages= | |Pages=234-246 | ||
|Publisher=Springer | |Publisher=Springer | ||
|Editor=Tomi Janhunen, Ilkka Niemelä | |Editor=Tomi Janhunen, Ilkka Niemelä | ||
|Series=LNAI | |Series=LNAI | ||
|Volume=6341 | |||
}} | }} | ||
{{Publikation Details | {{Publikation Details | ||
|Abstract=We develop inferencing methods for SROEL(⊓,×) – a DL that subsumes the main features of the W3C recommendation OWL EL –, and present a framework for studying materialisation calculi based on datalog. The latter is used to investigate the resource requirements for inferencing, and we can show that certain SROEL(⊓,×) feature combinations must lead to increased space upper bounds in any materialisation calculus, suggesting that efficient implementations are easier to obtain for suitably chosen fragments of SROEL(⊓,×). | |Abstract=We develop inferencing methods for SROEL(⊓,×) – a DL that subsumes the main features of the W3C recommendation OWL EL –, and present a framework for studying materialisation calculi based on datalog. The latter is used to investigate the resource requirements for inferencing, and we can show that certain SROEL(⊓,×) feature combinations must lead to increased space upper bounds in any materialisation calculus, suggesting that efficient implementations are easier to obtain for suitably chosen fragments of SROEL(⊓,×). | ||
|Download=Kroetzsch | |||
| | The extended technical report about this work is called [[Techreport3005|Efficient Inferencing for the Description Logic Underlying OWL EL]]. A reworked version has later appeared at IJCAI 2011. | ||
|Download=Kroetzsch OWL-EL-Reasoning Jelia2010.pdf, | |||
|DOI Name=10.1007/978-3-642-15675-5_21 | |||
|Forschungsgruppe=Information Systems | |Forschungsgruppe=Information Systems | ||
}} | }} | ||
| Zeile 24: | Zeile 27: | ||
}} | }} | ||
{{Forschungsgebiet Auswahl | {{Forschungsgebiet Auswahl | ||
|Forschungsgebiet= | |Forschungsgebiet=Wissensrepräsentation und logisches Schließen | ||
}} | }} | ||
Version vom 20. Oktober 2014, 15:06 Uhr
Efficient Inferencing for OWL EL
Markus KrötzschMarkus Krötzsch
Markus Krötzsch
Efficient Inferencing for OWL EL
In Tomi Janhunen, Ilkka Niemelä, eds., Proceedings of the 12th European Confernce on Logics in Artificial Intelligence (JELIA'10), volume 6341 of LNAI, 234-246, 2010. Springer
Efficient Inferencing for OWL EL
In Tomi Janhunen, Ilkka Niemelä, eds., Proceedings of the 12th European Confernce on Logics in Artificial Intelligence (JELIA'10), volume 6341 of LNAI, 234-246, 2010. Springer
- KurzfassungAbstract
We develop inferencing methods for SROEL(⊓,×) – a DL that subsumes the main features of the W3C recommendation OWL EL –, and present a framework for studying materialisation calculi based on datalog. The latter is used to investigate the resource requirements for inferencing, and we can show that certain SROEL(⊓,×) feature combinations must lead to increased space upper bounds in any materialisation calculus, suggesting that efficient implementations are easier to obtain for suitably chosen fragments of SROEL(⊓,×). The extended technical report about this work is called Efficient Inferencing for the Description Logic Underlying OWL EL. A reworked version has later appeared at IJCAI 2011. - Forschungsgruppe:Research Group: Information Systems„Information Systems“ befindet sich nicht in der Liste (Computational Logic, Automatentheorie, Wissensverarbeitung, Knowledge-Based Systems, Knowledge Systems, Wissensbasierte Systeme, Logische Programmierung und Argumentation, Algebra und Diskrete Strukturen, Knowledge-aware Artificial Intelligence, Algebraische und logische Grundlagen der Informatik) zulässiger Werte für das Attribut „Forschungsgruppe“.Knowledge-Based Systems
@inproceedings{K2010,
author = {Markus Kr{\"{o}}tzsch},
title = {Efficient Inferencing for {OWL} {EL}},
editor = {Tomi Janhunen and Ilkka Niemel{\"{a}}},
booktitle = {Proceedings of the 12th European Confernce on Logics in
Artificial Intelligence (JELIA'10)},
series = {LNAI},
volume = {6341},
publisher = {Springer},
year = {2010},
pages = {234-246},
doi = {10.1007/978-3-642-15675-5_21}
}
