Reasoning with Forest Logic Programs and f-hybrid Knowledge Bases

Details Reasoning with Forest Logic Programs and f-hybrid Knowledge Bases Reasoning with Forest Logic Programs and f-hybrid Knowledge Bases

2011-10-12

arxiv.org/abs/1110.2773v1

Computer Science

Logic in Computer Science

Scientific paper

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 article, 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 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 current integration approaches of ontologies and rules.

Affiliated with

Also associated with

No associations

Rating

Reasoning with Forest Logic Programs and f-hybrid Knowledge Bases does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Reasoning with Forest Logic Programs and f-hybrid Knowledge Bases, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Reasoning with Forest Logic Programs and f-hybrid Knowledge Bases will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-634910