Abstract
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.
A preliminary version of this work, without the implementation, was presented at the 3rd Int. Workshop on Applications of Logic Programming to the (Semantic) Web and Web Services (ALPSWS 2008) for a limited audience.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
RacerPro 1.9.0. Racer Systems GmbH & Co. KG, http://www.racer-systems.com/index.phtml
BProlog 7.1. Afany software, http://www.probp.com/
Baader, F., Calvanese, D., McGuinness, D.L., Nardi, D., Patel-Schneider, P.F. (eds.): The Description Logic Handbook: Theory, Implementation, and Applications. Cambridge University Press, Cambridge (2003)
Eiter, T., Ianni, G., Lukasiewicz, T., Schindlauer, R., Tompits, H.: Combining answer set programming with description logics for the semantic web. Artificial Intelligence 172(12-13), 1495–1539 (2008)
Feier, C., Heymans, S.: A sound and complete algorithm for simple conceptual logic programs. Technical Report INFSYS Research Report 184-08-10, KBS Group, Technical University Vienna, Austria (October 2008), http://www.kr.tuwien.ac.at/staff/heymans/priv/projects/fwf-doasp/alpsws2008-tr.pdf
Gelfond, M., Lifschitz, V.: The Stable Model Semantics for Logic Programming. In: Proc. of ICLP 1988, Cambridge, Massachusetts, pp. 1070–1080 (1988)
Grosof, B.N., Horrocks, I., Volz, R., Decker, S.: Description logic programs: combining logic programs with description logic. In: Proc. of the World Wide Web Conference (WWW), pp. 48–57. ACM, New York (2003)
Heymans, S., de Bruijn, J., Predoiu, L., Feier, C., Van Nieuwenborgh, D.: Guarded hybrid knowledge bases. Theory and Practice of Logic Programming 8(3), 411–429 (2008)
Heymans, S., Van Nieuwenborgh, D., Vermeir, D.: Conceptual logic programs. Annals of Mathematics and Artificial Intelligence (Special Issue on Answer Set Programming) 47(1–2), 103–137 (2006)
Heymans, S., Van Nieuwenborgh, D., Vermeir, D.: Open answer set programming for the semantic web. Journal of Applied Logic 5(1), 144–169 (2007)
Heymans, S., Van Nieuwenborgh, D., Vermeir, D.: Open answer set programming with guarded programs. ACM Transactions on Computational Logic (TOCL)Â 9(4) (October 2008)
Krötzsch, M., Rudolph, S., Hitzler, P.: Description logic rules. In: Proc. 18th European Conf. on Artificial Intelligence (ECAI 2008), pp. 80–84. IOS Press, Amsterdam (2008)
Lukasiewicz, T.: A novel combination of answer set programming with description logics for the semantic web. In: Franconi, E., Kifer, M., May, W. (eds.) ESWC 2007. LNCS, vol. 4519, pp. 384–398. Springer, Heidelberg (2007)
Motik, B., Sattler, U., Studer, R.: Query answering for OWL-DL with rules. Journal of Web Semantics 3(1), 41–60 (2005)
Rosati, R.: DL+log: Tight integration of description logics and disjunctive datalog. In: Proc. KR, pp. 68–78 (2006)
Rosati, R.: On the decidability and complexity of integrating ontologies and rules. Journal of Web Semantics 3(1), 61–73 (2005)
Tobies, S.: Complexity Results and Practical Algorithms for Logics in Knowledge Representation. PhD thesis (2001)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Heymans, S., Feier, C., Eiter, T. (2009). A Reasoner for Simple Conceptual Logic Programs. In: Polleres, A., Swift, T. (eds) Web Reasoning and Rule Systems. RR 2009. Lecture Notes in Computer Science, vol 5837. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-05082-4_5
Download citation
DOI: https://doi.org/10.1007/978-3-642-05082-4_5
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-05081-7
Online ISBN: 978-3-642-05082-4
eBook Packages: Computer ScienceComputer Science (R0)