Stage-oe-small.jpg

Article3068: Unterschied zwischen den Versionen

Aus Aifbportal
Wechseln zu:Navigation, Suche
(Die Seite wurde neu angelegt: „{{Publikation Erster Autor |ErsterAutorNachname=Rudolph |ErsterAutorVorname=Sebastian }} {{Publikation Author |Rank=2 |Author=Markus Krötzsch }} {{Publikation Au…“)
 
K (Textersetzung - „Forschungsgruppe=Wissensmanagement“ durch „Forschungsgruppe=Web Science und Wissensmanagement“)
 
(2 dazwischenliegende Versionen von einem anderen Benutzer werden nicht angezeigt)
Zeile 15: Zeile 15:
 
|Title=Type-Elimination-Based Reasoning for the Description Logic SHIQbs Using Decision Diagrams and Disjunctive Datalog
 
|Title=Type-Elimination-Based Reasoning for the Description Logic SHIQbs Using Decision Diagrams and Disjunctive Datalog
 
|Year=2012
 
|Year=2012
 +
|Month=Februar
 
|Journal=Logical Methods in Computer Science
 
|Journal=Logical Methods in Computer Science
|Note=to appear
+
|Volume=8
 +
|Number=1:12
 +
|Pages=1-38
 
}}
 
}}
 
{{Publikation Details
 
{{Publikation Details
 
|Abstract=We propose a novel, type-elimination-based method for standard reasoning in the description logic SHIQbs extended by DL-safe rules. To this end, we first establish a knowledge compilation method converting the terminological part of an ALCIb knowledge base into an ordered binary decision diagram (OBDD) which represents a canonical model. This OBDD can in turn be transformed into disjunctive Datalog and merged with the assertional part of the knowledge base in order to perform combined reasoning.
 
|Abstract=We propose a novel, type-elimination-based method for standard reasoning in the description logic SHIQbs extended by DL-safe rules. To this end, we first establish a knowledge compilation method converting the terminological part of an ALCIb knowledge base into an ordered binary decision diagram (OBDD) which represents a canonical model. This OBDD can in turn be transformed into disjunctive Datalog and merged with the assertional part of the knowledge base in order to perform combined reasoning.
In order to leverage our technique for full SHIQbs, we provide a stepwise reduction from SHIQbs to \ALCIb that preserves satisfiability and entailment of positive and negative ground facts.
+
In order to leverage our technique for full SHIQbs, we provide a stepwise reduction from SHIQbs to ALCIb that preserves satisfiability and entailment of positive and negative ground facts.
 
The proposed technique is shown to be worst case optimal w.r.t. combined and data complexity.
 
The proposed technique is shown to be worst case optimal w.r.t. combined and data complexity.
 +
|Download=RudolphKH-LMCS-2012.pdf,
 +
|Link=http://www.lmcs-online.org/ojs/viewarticle.php?id=975&layout=abstract
 
|Projekt=ExpresST
 
|Projekt=ExpresST
|Forschungsgruppe=Wissensmanagement
+
|Forschungsgruppe=Web Science und Wissensmanagement
 
}}
 
}}
 
{{Forschungsgebiet Auswahl
 
{{Forschungsgebiet Auswahl

Aktuelle Version vom 15. Oktober 2015, 11:48 Uhr


Type-Elimination-Based Reasoning for the Description Logic SHIQbs Using Decision Diagrams and Disjunctive Datalog


Type-Elimination-Based Reasoning for the Description Logic SHIQbs Using Decision Diagrams and Disjunctive Datalog



Veröffentlicht: 2012 Februar

Journal: Logical Methods in Computer Science
Nummer: 1:12Der Datenwert „:12“ kann einem Attribut des Datentyps Zahl nicht zugeordnet werden sondern bspw. der Datenwert „1“.
Seiten: 1-38

Volume: 8


Referierte Veröffentlichung

BibTeX




Kurzfassung
We propose a novel, type-elimination-based method for standard reasoning in the description logic SHIQbs extended by DL-safe rules. To this end, we first establish a knowledge compilation method converting the terminological part of an ALCIb knowledge base into an ordered binary decision diagram (OBDD) which represents a canonical model. This OBDD can in turn be transformed into disjunctive Datalog and merged with the assertional part of the knowledge base in order to perform combined reasoning. In order to leverage our technique for full SHIQbs, we provide a stepwise reduction from SHIQbs to ALCIb that preserves satisfiability and entailment of positive and negative ground facts. The proposed technique is shown to be worst case optimal w.r.t. combined and data complexity.

Download: Media:RudolphKH-LMCS-2012.pdf
Weitere Informationen unter: Link

Projekt

ExpresST



Forschungsgruppe

Web Science und Wissensmanagement


Forschungsgebiet

Wissensrepräsentationssprachen, Beschreibungslogik, Logikprogrammierung