Bridging the gap between OWL and relational databases
Proceedings of the 16th international conference on World Wide Web
Guarded hybrid knowledge bases12
Theory and Practice of Logic Programming
Bridging the gap between OWL and relational databases
Web Semantics: Science, Services and Agents on the World Wide Web
Hybrid Reasoning with Forest Logic Programs
ESWC 2009 Heraklion Proceedings of the 6th European Semantic Web Conference on The Semantic Web: Research and Applications
A Reasoner for Simple Conceptual Logic Programs
RR '09 Proceedings of the 3rd International Conference on Web Reasoning and Rule Systems
Embedding nonground logic programs into autoepistemic logic for knowledge-base combination
ACM Transactions on Computational Logic (TOCL)
Hi-index | 0.00 |
Open answer set programming (OASP) solves the lack of modularity in closed world answer set programming by allowing for the grounding of logic programs with an arbitrary non-empty countable superset of the program's constants. However, OASP is, in general, undecidable: the undecidable domino problem can be reduced to it. In order to regain decidability, we restrict the shape of logic programs, yielding conceptual logic programs (CoLPs). CoLPs are logic programs with unary and binary predicates (possibly inverted) where rules have a tree shape. Decidability of satisfiability checking of predicates w.r.t. CoLPs is shown by a reduction to non-emptiness checking of two-way alternating tree automata. We illustrate the expressiveness of CoLPs by simulating the description logic $\mathcal{SHIQ}$ . CoLPs thus integrate, in one unifying framework, the best of both the logic programming paradigm (a flexible rule-based representation and nonmonotonicity by means of negation as failure) and the description logics paradigm (decidable open domain reasoning).