Abstract
In this paper we study query answering over ontologies expressed in Datalog+/–, i.e., datalog with existential variables in rule heads. Differently from previous proposals, we focus on subclasses of unions of conjunctive queries (UCQs), rather than on the whole class of UCQs. To identify subclasses of UCQs, we introduce the notion of conjunctive query pattern. Given a class of queries \({\mathcal Q}\) expressed by a conjunctive query pattern, we study decidability and complexity of answering queries in \({\mathcal Q}\) over a Datalog+/– program. In particular, we define an algorithm that, given a Datalog+/– program P and a class of queries \({\mathcal Q}\), is able to compute a simplified Datalog+/– program P′ that is equivalent to P with respect to answering queries in \({\mathcal Q}\). We show that such an algorithm constitutes both a theoretical and a practical interesting tool for studying query answering over ontologies expressed in terms of Datalog+/– rules.
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
Baget, J.-F., Leclère, M., Mugnier, M.-L., Salvat, E.: On rules with existential variables: Walking the decidability line. Artificial Intelligence 175(9-10), 1620–1654 (2011)
Baget, J.-F., Mugnier, M.-L., Rudolph, S., Thomazo, M.: Walking the complexity lines for generalized guarded existential rules. In: Proc. of the 22st Int. Joint Conf. on Artificial Intelligence (IJCAI 2011), pp. 712–717 (2011)
Bancilhon, F., Maier, D., Sagiv, Y., Ullman, J.D.: Magic sets and other strange ways to implement logic programs. In: Proc. of the 5th ACM SIGACT SIGMOD Symp. on Principles of Database Systems (PODS 1986) (1986)
Calì, A., Gottlob, G., Lukasiewicz, T.: A general Datalog-based framework for tractable query answering over ontologies. In: Proc. of the 28th ACM SIGACT SIGMOD SIGART Symp. on Principles of Database Systems (PODS 2009), pp. 77–86 (2009)
Calì, A., Gottlob, G., Lukasiewicz, T.: A general Datalog-based framework for tractable query answering over ontologies. Technical Report CL-RR-10-21. Oxford University Computing Laboratory (2010)
Calì, A., Gottlob, G., Pieris, A.: Query rewriting under non-guarded rules. In: Proc. of the 4th Alberto Mendelzon Int. Workshop on Foundations of Data Management (AMW 2010) (2010)
Calì, A., Gottlob, G., Pieris, A.: New expressive languages for ontological query answering. In: Proc. of the 25th AAAI Conf. on Artificial Intelligence, AAAI 2011 (2011)
Calì, A., Lembo, D., Rosati, R.: Query rewriting and answering under constraints in data integration systems. In: Proc. of the 18th Int. Joint Conf. on Artificial Intelligence (IJCAI 2003), pp. 16–21 (2003)
Calvanese, D., De Giacomo, G., Lembo, D., Lenzerini, M., Rosati, R.: Tractable reasoning and efficient query answering in description logics: The DL-Lite family. J. of Automated Reasoning 39(3), 385–429 (2007)
Cosmadakis, S.S., Gaifman, H., Kanellakis, P.C., Vardi, M.Y.: Decidable optimization problems for database logic programs. In: Proc. of the 20th ACM SIGACT Symp. on Theory of Computing (STOC 1988), pp. 477–490 (1988)
Eiter, T., Fink, M., Woltran, S.: Semantical characterizations and complexity of equivalences in answer set programming. ACM Trans. on Computational Logic 8(3) (2007)
Gottlob, G., Orsi, G., Pieris, A.: Ontological queries: Rewriting and optimization. In: Proc. of the 27th IEEE Int. Conf. on Data Engineering (ICDE 2011), pp. 2–13 (2011)
Gottlob, G., Orsi, G., Pieris, A.: Ontological Query Answering via Rewriting. In: Eder, J., Bielikova, M., Tjoa, A.M. (eds.) ADBIS 2011. LNCS, vol. 6909, pp. 1–18. Springer, Heidelberg (2011)
Krötzsch, M., Rudolph, S.: Extending decidable existential rules by joining acyclicity and guardedness. In: Proc. of the 22st Int. Joint Conf. on Artificial Intelligence (IJCAI 2011), pp. 963–968 (2011)
Leone, N., Manna, M., Terracina, G., Veltri, P.: Efficiently computable Datalog ∃ programs. In: Proc. of the 13th Int. Conf. on the Principles of Knowledge Representation and Reasoning, KR 2012 (to appear, 2012)
Sagiv, Y.: Optimizing Datalog programs. In: Proc. of the 6th ACM SIGACT SIGMOD SIGART Symp. on Principles of Database Systems (PODS 1987), pp. 349–362 (1987)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Civili, C., Rosati, R. (2012). Query Patterns for Existential Rules. In: Krötzsch, M., Straccia, U. (eds) Web Reasoning and Rule Systems. RR 2012. Lecture Notes in Computer Science, vol 7497. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-33203-6_5
Download citation
DOI: https://doi.org/10.1007/978-3-642-33203-6_5
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-33202-9
Online ISBN: 978-3-642-33203-6
eBook Packages: Computer ScienceComputer Science (R0)