Computing datalog rewritings for disjunctive datalog programs and description logic ontologies
<p>We study the closely related problems of rewriting disjunctive datalog programs and non-Horn DL ontologies into plain datalog programs that entail the same facts for every dataset. We first propose the class of markable disjunctive datalog programs, which is efficiently recognisable and adm...
| Asıl Yazarlar: | , , |
|---|---|
| Materyal Türü: | Conference item |
| Dil: | English |
| Baskı/Yayın Bilgisi: |
Springer International Publishing
2014
|
| Konular: |