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
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
A Novel Combination of Answer Set Programming with Description Logics for the Semantic Web
ESWC '07 Proceedings of the 4th European conference on The Semantic Web: Research and Applications
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
Hi-index | 0.00 |
Open Answer Set Programming (OASP) can be seen as a framework to represent tightly integrated combined knowledge bases of ontologies and rules that are not necessarily DL-safe. The framework makes the open-domain assumption and has a rule-based syntax supporting negation under a stable model semantics. Although decidability of different fragments of OASP has been identified, reasoning and effective algorithms remained largely unexplored. In this paper, we describe an algorithm for satisfiability checking of the fragment of simple Conceptual Logic Programs and provide a BProlog implementation. To the best of our knowledge, this is the first implementation of a (fragment) of a framework that can tightly integrate ontologies and non-DL-safe rules under an expressive nonmonotonic semantics.