Inproceedings1463: Unterschied zwischen den Versionen
K (Added from ontology) |
K (Added from ontology) |
||
Zeile 1: | Zeile 1: | ||
+ | {{Publikation Author | ||
+ | |Rank=1 | ||
+ | |Author=Markus Krötzsch | ||
+ | }} | ||
{{Publikation Author | {{Publikation Author | ||
|Rank=2 | |Rank=2 | ||
|Author=Sebastian Rudolph | |Author=Sebastian Rudolph | ||
− | |||
− | |||
− | |||
− | |||
}} | }} | ||
{{Inproceedings | {{Inproceedings | ||
Zeile 24: | Zeile 24: | ||
|Link=http://www.aifb.uni-karlsruhe.de/Publikationen/showPublikation?publ_id=1550 | |Link=http://www.aifb.uni-karlsruhe.de/Publikationen/showPublikation?publ_id=1550 | ||
|DOI Name= | |DOI Name= | ||
− | |||
|Projekt= | |Projekt= | ||
|Forschungsgruppe= | |Forschungsgruppe= | ||
+ | }} | ||
+ | {{Forschungsgebiet Auswahl | ||
+ | |Forschungsgebiet=Wissensrepräsentationssprachen | ||
+ | }} | ||
+ | {{Forschungsgebiet Auswahl | ||
+ | |Forschungsgebiet=Theoretische Informatik | ||
+ | }} | ||
+ | {{Forschungsgebiet Auswahl | ||
+ | |Forschungsgebiet=Logik | ||
+ | }} | ||
+ | {{Forschungsgebiet Auswahl | ||
+ | |Forschungsgebiet=Beschreibungslogik | ||
+ | }} | ||
+ | {{Forschungsgebiet Auswahl | ||
+ | |Forschungsgebiet=Komplexitätstheorie | ||
+ | }} | ||
+ | {{Forschungsgebiet Auswahl | ||
+ | |Forschungsgebiet=Entscheidbarketisprobleme | ||
}} | }} |
Version vom 15. August 2009, 12:07 Uhr
Conjunctive Queries for EL with Role Composition
Conjunctive Queries for EL with Role Composition
Published: 2007
Juni
Herausgeber: D. Calvanese, E. Franconi, V. Haarslev, D. Lembo, B. Motik, A.-Y. Turhan and S. Tessaris
Buchtitel: Proceedings of the 20th International Workshop on Description Logics (DL2007)
Ausgabe: 250
Verlag: CEUR Workshop Proceedings
Referierte Veröffentlichung
BibTeX
Kurzfassung
EL++ is a rather expressive description logic (DL) that still admits polynomial time inferencing for many reasoning tasks. Conjunctive queries are an important means for expressive querying on DL knowledge bases. In this paper, we address the problem of computing conjunctive query entailment for EL++ knowledge bases. As it turns out, querying unrestricted EL++ is actually undecidable, but we identify restrictions under which query answering becomes decidable and even tractable. To the best of our knowledge, the presented algorithm is the first to answer conjunctive queries in a description logic that admits general role inclusion axioms.
ISSN: 1613-0073
Download: Media:2007_1463_Krötzsch_Conjunctive Que_1.pdf,Media:2007_1463_Krötzsch_Conjunctive Que_2.pdf
Weitere Informationen unter: Link
Wissensrepräsentationssprachen, Beschreibungslogik, Entscheidbarketisprobleme, Komplexitätstheorie, Logik, Theoretische Informatik