Reasoning with forest logic programs and f-hybrid knowledge bases

DOI10.1017/S1471068411000597MaRDI QIDQ5298799zbMATH OpenOpenAlexFDO

Authors Cristina Feier, Stijn Heymans

Publication date 14 June 2013

Published in Theory and Practice of Logic Programming (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1110.2773

zbMATH Keywords

f-hybrid knowledge basesfinite model propertyforest logic programsintegration of rules and ontologiesopen answer sets

Mathematics Subject Classification ID

Logic programming (68N17)

Abstract: 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.

Recommendations

• Reasoning with forest logic programs using fully enriched automata
• Open answer set programming for the semantic web
• Conceptual logic programs
• Open answer set programming with guarded programs
• Logic Programming and Nonmonotonic Reasoning

Cites work

• Abduction in logic programming: A new definition and an abductive procedure based on rewriting
• Combining answer set programming with description logics for the semantic web
• Complexity results for answer set programming with bounded predicate arities and implications
• Description logics of minimal knowledge and negation as failure
• scientific article; zbMATH DE number 3986613 (Why is no real title available?)
• Open answer set programming for the semantic web
• Web reasoning and rule systems. Third international conference, RR 2009, Chantilly, VA, USA, October 25--26, 2009, Proceedings

Cited in

(3)

• Reasoning with forest logic programs using fully enriched automata
• Conceptual logic programs
• Open answer set programming for the semantic web

This page was built for publication: Reasoning with forest logic programs and f-hybrid knowledge bases

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5298799)