Abstract
In this paper we present a novel approach for determining the instances of description logic concepts when huge amounts of underlying data are expected. In such cases, traditional description logic theorem proving techniques cannot be used due to performance problems. Our idea is to transform a concept description into a Prolog program which represents a query-plan. This transformation is done without any knowledge of the particular data. Data are accessed dynamically during the normal Prolog execution of the generated program. With this technique only those pieces of data are accessed which are indeed important for answering the query, i.e. we solve the original problem in a database friendly way. We evaluate the performance of our approach and compare it to several description logic reasoners.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Baader, F., Calvanese, D., McGuinness, D., Nardi, D., Patel-Schneider, P.F. (eds.): The Description Logic Handbook: Theory, Implementation and Applications. Cambridge University Press, Cambridge (2003)
Baumgartner, P., Furbach, U.: PROTEIN: A PROver with a theory extension INterface. In: Conference on Automated Deduction, pp. 769–773 (1994)
Benko, T., Krauth, P., Szeredi, P.: A logic-based system for application integration. In: Stuckey, P.J. (ed.) ICLP 2002. LNCS, vol. 2401, pp. 452–466. Springer, Heidelberg (2002)
Benkö, T., Lukácsy, G., Fokt, A., Szeredi, P., Kilián, I., Krauth, P.: Information integration through reasoning on meta-data. In: Proceedings of the Workshop “AI Moves to IA”, IJCAI 2003, Acapulco, Mexico, pp. 65–77 (2003)
Grosof, B.N., Horrocks, I., Volz, R., Decker, S.: Description logic programs: combining logic programs with description logic. In: Proceedings of WWW 2003, pp. 48–57. ACM Press, New York (2003)
Haarslev, V., Möller, R.: Optimization techniques for retrieving resources described in OWL/RDF documents: First results. In: Proceedings of the Ninth International Conference KR 2004, Whistler, Canada. AAAI Press, Menlo Park (2004)
Horrocks, I., Li, L., Turi, D., Bechhofer, S.: The Instance Store: DL reasoning with large numbers of individuals. In: Proceedings of DL 2004, British Columbia, Canada (2004)
Hustadt, U., Motik, B., Sattler, U.: Reasoning for Description Logics around SHIQ in a resolution framework. Technical report, FZI, Karlsruhe (2004)
KAON2: Ontology management tool for the Semantic Web, http://kaon2.semanticweb.org/
Kowalski, R., Kuehner, D.: Linear resolution with selection function. Artificial Intelligence 2, 227–260 (1971)
Stickel, M.E.: A Prolog technology theorem prover: a new exposition and implementation in Prolog. Theoretical Computer Science 104(1), 109–128 (1992)
Warren, D.S.: Programming in tabled Prolog (draft), http://www.cs.sunysb.edu/~warren/xsbbook/book.html
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Nagy, Z., Lukácsy, G., Szeredi, P. (2005). Translating Description Logic Queries to Prolog. In: Van Hentenryck, P. (eds) Practical Aspects of Declarative Languages. PADL 2006. Lecture Notes in Computer Science, vol 3819. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11603023_12
Download citation
DOI: https://doi.org/10.1007/11603023_12
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-30947-5
Online ISBN: 978-3-540-31685-5
eBook Packages: Computer ScienceComputer Science (R0)