{\cal A}{\cal L}-log: Integrating Datalog and Description Logics
Journal of Intelligent Information Systems
Reasoning about The Past with Two-Way Automata
ICALP '98 Proceedings of the 25th International Colloquium on Automata, Languages and Programming
Description logic programs: combining logic programs with description logic
WWW '03 Proceedings of the 12th international conference on World Wide Web
The description logic handbook: theory, implementation, and applications
The description logic handbook: theory, implementation, and applications
A proposal for an owl rules language
Proceedings of the 13th international conference on World Wide Web
Annals of Mathematics and Artificial Intelligence
Combining answer set programming with description logics for the Semantic Web
Artificial Intelligence
Open answer set programming with guarded programs
ACM Transactions on Computational Logic (TOCL)
Guarded hybrid knowledge bases12
Theory and Practice of Logic Programming
On Combining Description Logic Ontologies and Nonrecursive Datalog Rules
RR '08 Proceedings of the 2nd International Conference on Web Reasoning and Rule Systems
Proceedings of the 2008 conference on ECAI 2008: 18th European Conference on Artificial Intelligence
Query Answering for OWL-DL with rules
Web Semantics: Science, Services and Agents on the World Wide Web
On the decidability and complexity of integrating ontologies and rules
Web Semantics: Science, Services and Agents on the World Wide Web
FDNC: decidable non-monotonic disjunctive logic programs with function symbols
LPAR'07 Proceedings of the 14th international conference on Logic for programming, artificial intelligence and reasoning
Can OWL and logic programming live together happily ever after?
ISWC'06 Proceedings of the 5th international conference on The Semantic Web
Hybrid reasoning with non-monotonic rules
ReasoningWeb'10 Proceedings of the 6th international conference on Semantic technologies for software engineering
Local closed world reasoning with description logics under the well-founded semantics
Artificial Intelligence
| Hi-index | 0.00 |
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.