2009 | OriginalPaper | Chapter
Hybrid Reasoning with Forest Logic Programs
Authors : Cristina Feier, Stijn Heymans
Published in: The Semantic Web: Research and Applications
Publisher: Springer Berlin Heidelberg
Activate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. powered by
Open Answer Set Programming (OASP) is an attractive 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, a fragment where rules have a tree shape and allow for inequality atoms and constants. We further introduce f-hybrid knowledge bases, a hybrid framework where
$\mathcal SHOQ$
knowledge bases and forest logic programs co-exist, and we show that reasoning with such knowledge bases can be reduced to reasoning with forest logic programs only. We note that f-hybrid knowledge bases do not require the usual (weakly) DL-safety of the rule component, providing thus a genuine alternative approach to hybrid reasoning.