Techreport1767: Unterschied zwischen den Versionen
K (Added from ontology) |
K (Added from ontology) |
||
| Zeile 1: | Zeile 1: | ||
{{Publikation Author | {{Publikation Author | ||
| − | |Rank= | + | |Rank=3 |
| − | |Author= | + | |Author=Pascal Hitzler |
}} | }} | ||
{{Publikation Author | {{Publikation Author | ||
| Zeile 8: | Zeile 8: | ||
}} | }} | ||
{{Publikation Author | {{Publikation Author | ||
| − | |Rank= | + | |Rank=2 |
| − | |Author= | + | |Author=Markus Krötzsch |
}} | }} | ||
{{Techreport | {{Techreport | ||
| Zeile 21: | Zeile 21: | ||
|Abstract=We propose a novel method for reasoning in the description logic SHIQ. After a satisfiability preserving transformation from SHIQ to the description logic ALCIb, the obtained ALCIb Tbox T is converted into an ordered binary decision diagram (OBDD) which represents a canonical model for T. This OBDD is turned into a disjunctive datalog program that can be used for Abox reasoning. The algorithm is worst-case optimal w.r.t. data complexity, and admits easy extensions with DL-safe rules and ground conjunctive queries. | |Abstract=We propose a novel method for reasoning in the description logic SHIQ. After a satisfiability preserving transformation from SHIQ to the description logic ALCIb, the obtained ALCIb Tbox T is converted into an ordered binary decision diagram (OBDD) which represents a canonical model for T. This OBDD is turned into a disjunctive datalog program that can be used for Abox reasoning. The algorithm is worst-case optimal w.r.t. data complexity, and admits easy extensions with DL-safe rules and ground conjunctive queries. | ||
|VG Wort-Seiten= | |VG Wort-Seiten= | ||
| − | |Download= | + | |Download=2008_1767_Rudolph_Description_Log_1.pdf |
|Link=http://korrekt.org/page/Description_Logic_Reasoning_with_Decision_Diagrams | |Link=http://korrekt.org/page/Description_Logic_Reasoning_with_Decision_Diagrams | ||
|DOI Name= | |DOI Name= | ||
| − | |||
|Projekt=ReaSem, NeOn, Active, | |Projekt=ReaSem, NeOn, Active, | ||
|Forschungsgruppe= | |Forschungsgruppe= | ||
| + | }} | ||
| + | {{Forschungsgebiet Auswahl | ||
| + | |Forschungsgebiet=Beschreibungslogik | ||
| + | }} | ||
| + | {{Forschungsgebiet Auswahl | ||
| + | |Forschungsgebiet=Logik | ||
| + | }} | ||
| + | {{Forschungsgebiet Auswahl | ||
| + | |Forschungsgebiet=Wissensrepräsentationssprachen | ||
| + | }} | ||
| + | {{Forschungsgebiet Auswahl | ||
| + | |Forschungsgebiet=Wissensrepräsentation | ||
}} | }} | ||
Version vom 15. August 2009, 16:27 Uhr
Published: 2008
Mai
Institution: Universität Karlsruhe (TH)
Archivierungsnummer:1767
Kurzfassung
We propose a novel method for reasoning in the description logic SHIQ. After a satisfiability preserving transformation from SHIQ to the description logic ALCIb, the obtained ALCIb Tbox T is converted into an ordered binary decision diagram (OBDD) which represents a canonical model for T. This OBDD is turned into a disjunctive datalog program that can be used for Abox reasoning. The algorithm is worst-case optimal w.r.t. data complexity, and admits easy extensions with DL-safe rules and ground conjunctive queries.
Download: Media:2008_1767_Rudolph_Description_Log_1.pdf
Weitere Informationen unter: Link
Wissensrepräsentation, Wissensrepräsentationssprachen, Beschreibungslogik, Logik