Stage-oe-small.jpg

Article3068: Unterschied zwischen den Versionen

Aus Aifbportal
Wechseln zu:Navigation, Suche
Zeile 25: Zeile 25:
 
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
 
|Link=http://www.lmcs-online.org/ojs/viewarticle.php?id=975&layout=abstract
 
|Projekt=ExpresST
 
|Projekt=ExpresST

Version vom 24. März 2012, 20:17 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:12
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

Wissensmanagement


Forschungsgebiet

Wissensrepräsentationssprachen, Beschreibungslogik, Logikprogrammierung