[Zurück]


Zeitschriftenartikel:

C. Feier, S. Heymans:
"Reasoning with Forest Logic Programs and f-hybrid knowledge bases";
Theory and Practice of Logic Programming, FirstView (2011), S. 1 - 69.



Kurzfassung englisch:
Open Answer Set Programming (OASP) is an undecidable framework for integrating ontologies and rules. Although several decidable fragments of OASP have been identified, few reasoning procedures exist. In this paper, we provide a sound, complete, and terminating
algorithm for satisfiability checking w.r.t. Forest Logic Programs (FoLPs), a fragment of OASP where rules have a tree shape and allow for inequality atoms and constants. The algorithm establishes a decidability result for FoLPs. Although believed to be decidable, so far only the decidability for two small subsets of FoLPs, local FoLPs and acyclic FoLPs, has been shown. We further introduce f-hybrid knowledge bases, a hybrid framework where SHOQ knowledge bases and FoLPs coexist, and we show that reasoning with such knowledge bases can be reduced to reasoning with FoLPs only. We note that f-hybrid knowledge bases do not require the usual (weakly) DL-safety of the rule component, thus providing a genuine alternative approach to current integration approaches of ontologies and rules.

Schlagworte:
Forest Logic Programs, Open Answer Set Programming, f-hybrid knowledge bases, tableau algorithm, SHOQ, tableau algorithm


"Offizielle" elektronische Version der Publikation (entsprechend ihrem Digital Object Identifier - DOI)
http://dx.doi.org/10.1017/S1471068411000597


Erstellt aus der Publikationsdatenbank der Technischen Universität Wien.