Inproceedings4015: Unterschied zwischen den Versionen
Aus International Center for Computational Logic
Markus Krötzsch (Diskussion | Beiträge) K (Textersetzung - „Information Systems“ durch „Knowledge Systems“) |
Markus Krötzsch (Diskussion | Beiträge) Keine Bearbeitungszusammenfassung |
||
| Zeile 1: | Zeile 1: | ||
{{Publikation Erster Autor | {{Publikation Erster Autor | ||
|ErsterAutorVorname=Markus | |||
|ErsterAutorNachname=Krötzsch | |ErsterAutorNachname=Krötzsch | ||
}} | }} | ||
{{Inproceedings | {{Inproceedings | ||
| Zeile 11: | Zeile 11: | ||
|Pages=279-294 | |Pages=279-294 | ||
|Publisher=Springer | |Publisher=Springer | ||
|Note=This paper got nominated for the Best Paper award in the research track of ISWC 2012. Congratulations to Rahul Parundekar, Craig Knoblock and José Luis Ambite whose paper Discovering Concept Coverings in Ontologies of Linked Data Sources received the award. | |Note=This paper got nominated for the Best Paper award in the research track of ISWC 2012. Congratulations to Rahul Parundekar, Craig Knoblock and José Luis Ambite whose paper Discovering Concept Coverings in Ontologies of Linked Data Sources received the award. | ||
}} | }} | ||
{{Publikation Details | {{Publikation Details | ||
|Bild=ISWC2012.jpg | |Bild=ISWC2012.jpg | ||
|Abstract=The lightweight ontology language OWL RL is used for reasoning with large amounts of data. To this end, the W3C standard provides a simple system of deduction rules, which operate directly on the RDF syntax of OWL. Several similar systems have been studied. However, these approaches are usually complete for instance retrieval only. This paper asks if and how such methods could also be used for computing entailed subclass relationships. Checking entailment for arbitrary OWL RL class subsumptions is co-NP-hard, but tractable rule-based reasoning is possible when restricting to subsumptions between atomic classes. Surprisingly, however, this cannot be achieved in any RDF-based rule system, i.e., the W3C calculus cannot be extended to compute all atomic class subsumptions. We identify syntactic restrictions to mitigate this problem, and propose a rule system that is sound and complete for many OWL RL ontologies. | |Abstract=The lightweight ontology language OWL RL is used for reasoning with large amounts of data. To this end, the W3C standard provides a simple system of deduction rules, which operate directly on the RDF syntax of OWL. Several similar systems have been studied. However, these approaches are usually complete for instance retrieval only. This paper asks if and how such methods could also be used for computing entailed subclass relationships. Checking entailment for arbitrary OWL RL class subsumptions is co-NP-hard, but tractable rule-based reasoning is possible when restricting to subsumptions between atomic classes. Surprisingly, however, this cannot be achieved in any RDF-based rule system, i.e., the W3C calculus cannot be extended to compute all atomic class subsumptions. We identify syntactic restrictions to mitigate this problem, and propose a rule system that is sound and complete for many OWL RL ontologies. | ||
|ISBN=978-3-642-35176-1 | |ISBN=978-3-642-35176-1 | ||
|ISSN=0302-9743 | |ISSN=0302-9743 | ||
| Zeile 23: | Zeile 23: | ||
|Forschungsgruppe=Knowledge Systems | |Forschungsgruppe=Knowledge Systems | ||
|DOI=http://dx.doi.org/10.1007/978-3-642-35176-1_18 | |DOI=http://dx.doi.org/10.1007/978-3-642-35176-1_18 | ||
}} | |||
{{Forschungsgebiet Auswahl | |||
|Forschungsgebiet=Beschreibungslogiken | |||
}} | |||
{{Forschungsgebiet Auswahl | |||
|Forschungsgebiet=Semantische Technologien | |||
}} | |||
{{Forschungsgebiet Auswahl | |||
|Forschungsgebiet=Wissensrepräsentation und logisches Schließen | |||
}} | }} | ||
Version vom 28. Oktober 2014, 18:55 Uhr
The Not-So-Easy Task of Computing Class Subsumptions in OWL RL
Markus KrötzschMarkus Krötzsch
Markus Krötzsch
The Not-So-Easy Task of Computing Class Subsumptions in OWL RL
Proc. 11th International Semantic Web Conference (ISWC'11), 279-294, 2012. Springer
The Not-So-Easy Task of Computing Class Subsumptions in OWL RL
Proc. 11th International Semantic Web Conference (ISWC'11), 279-294, 2012. Springer
- KurzfassungAbstract
The lightweight ontology language OWL RL is used for reasoning with large amounts of data. To this end, the W3C standard provides a simple system of deduction rules, which operate directly on the RDF syntax of OWL. Several similar systems have been studied. However, these approaches are usually complete for instance retrieval only. This paper asks if and how such methods could also be used for computing entailed subclass relationships. Checking entailment for arbitrary OWL RL class subsumptions is co-NP-hard, but tractable rule-based reasoning is possible when restricting to subsumptions between atomic classes. Surprisingly, however, this cannot be achieved in any RDF-based rule system, i.e., the W3C calculus cannot be extended to compute all atomic class subsumptions. We identify syntactic restrictions to mitigate this problem, and propose a rule system that is sound and complete for many OWL RL ontologies. - Bemerkung: Note: This paper got nominated for the Best Paper award in the research track of ISWC 2012. Congratulations to Rahul Parundekar, Craig Knoblock and José Luis Ambite whose paper Discovering Concept Coverings in Ontologies of Linked Data Sources received the award.
- Weitere Informationen unter:Further Information: Link
- Forschungsgruppe:Research Group: Knowledge SystemsKnowledge-Based Systems
@inproceedings{K2012,
author = {Markus Kr{\"{o}}tzsch},
title = {The Not-So-Easy Task of Computing Class Subsumptions in {OWL}
{RL}},
booktitle = {Proc. 11th International Semantic Web Conference (ISWC'11)},
publisher = {Springer},
year = {2012},
pages = {279-294},
doi = {10.1007/978-3-642-35176-1_18}
}
