research-article

A logical toolbox for ontological reasoning

Authors:

Thomas Lukasiewicz,

Andreas PierisAuthors Info & Claims

ACM SIGMOD Record, Volume 40, Issue 3

Pages 5 - 14

https://doi.org/10.1145/2070736.2070738

Published: 17 November 2011 Publication History

Abstract

In ontology-enhanced database systems, an ontology on top of the extensional database expresses intensional knowledge that enhances the database schema. Queries posed to such systems are to be evaluated considering all the knowledge inferred from the data by means of the ontology; in other words, queries are to be evaluated against the logical theory constituted by the data and the ontology. In this context, tractability of query answering is a central issue, given that the data size is normally very large. This paper surveys results on a recently introduced family of Datalog-based languages, called Datalog+/-, which is a useful logical toolbox for ontology modeling and for ontology-based query answering. We present different Datalog+/- languages and related complexity results, showing that Datalog+/- can be successfully adopted due to its clarity, expressiveness and its good computational properties.

References

[1]

S. Abiteboul, R. Hull, and V. Vianu. Foundations of Databases. Addison-Wesley, 1995.

Digital Library

[2]

P. Alvaro, W. Marczak, N. Conway, J. M. Hellerstein, D. Maier, and R. C. Sears. Towards scalable architectures for clickstream data warehousing. Technical report, EECS Department, University of California, Berkeley, 2009.

[3]

H. Andréka, J. van Benthem, and I. Németi. Modal languages and bounded fragments of predicate logic. J. Philosophical Logic, 27:217--274, 1998.

[4]

J.-F. Baget, M. Leclère, M.-L. Mugnier, and E. Salvat. On rules with existential variables: Walking the decidability line. Artif. Intell., 175(9-10):1620--1654, 2011.

Digital Library

[5]

V. Bárány, G. Gottlob, and M. Otto. Querying the guarded fragment. In Proc. of LICS, pages 1--10, 2010.

Digital Library

[6]

R. Baumgartner, S. Flesca, and G. Gottlob. Visual web information extraction with Lixto. In Proc. of VLDB, pages 119--128, 2001.

Digital Library

[7]

R. Baumgartner, W. Gatterbauer, and G. Gottlob. Monadic Datalog and the expressive power of web information extraction languages. In L. Liu and M. T. Özsu, editors, Encyclopedia of Database Systems, pages 3465--3471. Springer-Verlag New York, Inc., 2009.

[8]

C. Beeri and M. Y. Vardi. The implication problem for data dependencies. In Proc. of ICALP, pages 73--85, 1981.

Digital Library

[9]

D. Brickley and R. V. Guha. RDF vocabulary description language 1.0: RDF Schema. http://www.w3.org/TR/2004/REC-rdf-schema-20040210/, 2004. W3C Recommendation.

[10]

L. Cabibbo. The expressive power of stratified logic programs with value invention. Inf. Comput., 147(1):22--56, 1998.

Digital Library

[11]

A. Calì, G. Gottlob, and M. Kifer. Taming the infinite chase: Query answering under expressive relational constraints. In Proc. of KR, pages 70--80, 2008.

Digital Library

[12]

A. Calì, G. Gottlob, and T. Lukasiewicz. A general datalog-based framework for tractable query answering over ontologies. In Proc. of PODS, pages 77--86, 2009.

Digital Library

[13]

A. Calì, G. Gottlob, and A. Pieris. Towards more expressive ontology langugaes: The query answering problem. Unpublished Manuscript.

[14]

A. Calì, G. Gottlob, and A. Pieris. Advanced processing for ontological queries. PVLDB, 3(1):554--565, 2010.

Digital Library

[15]

A. Calì, G. Gottlob, and A. Pieris. Query rewriting under non-guarded rules. In Proc. AMW, 2010.

[16]

A. Calì, D. Lembo, and R. Rosati. On the decidability and complexity of query answering over inconsistent and incomplete databases. In Proc. of PODS, pages 260--271, 2003.

Digital Library

[17]

D. Calvanese. Finite model reasoning in description logics. In Proc. of KR, pages 292--303, 1996.

[18]

D. Calvanese, G. De Giacomo, D. Lembo, M. Lenzerini, and R. Rosati. Tractable reasoning and efficient query answering in description logics: The DL-lite family. J. Autom. Reasoning, 39(3):385--429, 2007.

Digital Library

[19]

M. A. Casanova, R. Fagin, and C. H. Papadimitriou. Inclusion dependencies and their interaction with functional dependencies. J. Comput. Syst. Sci., 28:29--59, 1984.

[20]

A. K. Chandra and P. M. Merlin. Optimal implementation of conjunctive queries in relational data bases. In Proc. of STOCS, pages 77--90, 1977.

Digital Library

[21]

A. K. Chandra and M. Y. Vardi. The implication problem for functional and inclusion dependencies. SIAM Journal of Computing, 14:671--677, 1985.

[22]

J. de Bruijn and S. Heymans. Logical foundations of (e)RDF(S): Complexity and reasoning. In Proc. of ISWC, pages 86--99, 2007.

Digital Library

[23]

A. Deutsch, A. Nash, and J. B. Remmel. The chase revisisted. In Proc. of PODS, pages 149--158, 2008.

Digital Library

[24]

R. Fagin, P. G. Kolaitis, R. J. Miller, and L. Popa. Data exchange: Semantics and query answering. Theor. Comput. Sci., 336(1):89--124, 2005.

Digital Library

[25]

G. Gottlob and C. Koch. Monadic Datalog and the expressive power of web information extraction languages. J. ACM, 51(1):71--113, 2004.

Digital Library

[26]

G. Gottlob and C. H. Papadimitriou. On the complexity of single-rule Datalog queries. Inf. and Comput., 183(1):104--122, 2003.

Digital Library

[27]

G. Gottlob and T. Schwentick. Rewriting ontological queries into small non-recursive Datalog programs. In Proc. of DL, 2011.

[28]

E. Hajiyev, M. Verbaere, and O. de Moor. codeQuest: scalable source code queries with Datalog. In Proc. of ECOOP, pages 2--27, 2006.

Digital Library

[29]

D. S. Johnson and A. C. Klug. Testing containment of conjunctive queries under functional and inclusion dependencies. J. Comput. Syst. Sci., 28(1):167--189, 1984.

[30]

C. Lutz, U. Sattler, and L. Tendera. The complexity of finite model reasoning in description logics. Inf. Comput., 199(1-2):132--171, 2005.

Digital Library

[31]

D. Maier, A. O. Mendelzon, and Y. Sagiv. Testing implications of data dependencies. ACM Trans. Database Syst., 4(4):455--469, 1979.

Digital Library

[32]

D. Mailharrow. A classification and constraint-based framework for configuration. Artif. Intell. for Engineering Design, Analysis and Manufacturing, 12(4):383--397, 1998.

Digital Library

[33]

B. Marnette. Generalized schema-mappings: from termination to tractability. In Proc. of PODS, pages 13--22, 2009.

Digital Library

[34]

P. F. Patel-Schneider and I. Horrocks. A comparison of two modelling paradigms in the semantic web. J. Web Semantics, 5(4):240--250, 2007.

Digital Library

[35]

A. Poggi, D. Lembo, D. Calvanese, G. De Giacomo, M. Lenzerini, and R. Rosati. Linking data to ontologies. J. Data Semantics, 10:133--173, 2008.

Digital Library

[36]

R. Rosati. Finite model reasoning in DL-lite. In Semantic Web Conf., pages 215--229, 2008.

Digital Library

[37]

R. Rosati. On the finite controllability of conjunctive query answering in databases under open-world assumption. J. Comput. Syst. Sci., 77(3):572--594, 2011.

Digital Library

[38]

S. Rudolph, M. Krötzsch, and P. Hitzler. All elephants are bigger than all mice. In Description Logics, 2008.

[39]

M. Y. Vardi. The complexity of relational query languages. In Proc. of STOC, pages 137--146, 1982.

Digital Library

[40]

M. Y. Vardi, 1984. Personal communication reported in {29}.

[41]

M. Y. Vardi. On the complexity of bounded-variable queries. In Proc. of PODS, pages 266--276, 1995.

Digital Library

Cited By

El Husseini WEl Vaigh CGoasdoué FJaudoin HChua TNgo CKa-Wei Lee RKumar RLauw H(2024)Query Optimization for Ontology-Mediated Query AnsweringProceedings of the ACM on Web Conference 202410.1145/3589334.3645567(2138-2148)Online publication date: 13-May-2024
https://dl.acm.org/doi/10.1145/3589334.3645567
Bertossi LMilani M(2023) Extending sticky-Datalog via finite-position selection functions: Tractability, algorithms, and optimization Information Systems10.1016/j.is.2022.102156114(102156)Online publication date: Mar-2023
https://doi.org/10.1016/j.is.2022.102156
Amarilli ABenedikt MVan den Bussche JArenas M(2018)When Can We Answer Queries Using Result-Bounded Data Interfaces?Proceedings of the 37th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems10.1145/3196959.3196965(281-293)Online publication date: 27-May-2018
https://dl.acm.org/doi/10.1145/3196959.3196965
Show More Cited By

Index Terms

A logical toolbox for ontological reasoning
1. Computing methodologies
  1. Artificial intelligence
    1. Knowledge representation and reasoning
  2. Symbolic and algebraic manipulation
    1. Symbolic and algebraic algorithms
      1. Theorem proving algorithms
2. Theory of computation
  1. Logic

Recommendations

Ontological queries: Rewriting and optimization
ICDE '11: Proceedings of the 2011 IEEE 27th International Conference on Data Engineering

Ontological queries are evaluated against an enterprise ontology rather than directly on a database. The evaluation and optimization of such queries is an intriguing new problem for database research. In this paper we discuss two important aspects of ...
Reformulating Ontological Queries Using Materialised Rewritings
WIMS '16: Proceedings of the 6th International Conference on Web Intelligence, Mining and Semantics

Query rewriting is a prominent technique in ontology-based data access (OBDA) applications. Roughly speaking, a rewriting of a query Q w.r.t. an ontology is another query Q' that can be directly evaluated over the data without further reference to the ...
Well-founded semantics for extended datalog and ontological reasoning
PODS '13: Proceedings of the 32nd ACM SIGMOD-SIGACT-SIGAI symposium on Principles of database systems

The Datalog± family of expressive extensions of Datalog has recently been introduced as a new paradigm for query answering over ontologies, which captures and extends several common description logics. It extends plain Datalog by features such as ...

Comments

Information & Contributors

Information

Published In

cover image ACM SIGMOD Record

ACM SIGMOD Record Volume 40, Issue 3

September 2011

65 pages

ISSN:0163-5808

DOI:10.1145/2070736

Issue’s Table of Contents

Copyright © 2011 Authors.

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 17 November 2011

Published in SIGMOD Volume 40, Issue 3

Check for updates

Qualifiers

Research-article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

8
Total Citations
View Citations
197
Total Downloads

Downloads (Last 12 months)6
Downloads (Last 6 weeks)2

Reflects downloads up to 09 Aug 2024

Other Metrics

View Author Metrics

Citations

Cited By

El Husseini WEl Vaigh CGoasdoué FJaudoin HChua TNgo CKa-Wei Lee RKumar RLauw H(2024)Query Optimization for Ontology-Mediated Query AnsweringProceedings of the ACM on Web Conference 202410.1145/3589334.3645567(2138-2148)Online publication date: 13-May-2024
https://dl.acm.org/doi/10.1145/3589334.3645567
Bertossi LMilani M(2023) Extending sticky-Datalog via finite-position selection functions: Tractability, algorithms, and optimization Information Systems10.1016/j.is.2022.102156114(102156)Online publication date: Mar-2023
https://doi.org/10.1016/j.is.2022.102156
Amarilli ABenedikt MVan den Bussche JArenas M(2018)When Can We Answer Queries Using Result-Bounded Data Interfaces?Proceedings of the 37th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems10.1145/3196959.3196965(281-293)Online publication date: 27-May-2018
https://dl.acm.org/doi/10.1145/3196959.3196965
Benedikt MLeblay JTsamoura E(2015)Querying with access patterns and integrity constraintsProceedings of the VLDB Endowment10.14778/2735703.27357088:6(690-701)Online publication date: 1-Feb-2015
https://dl.acm.org/doi/10.14778/2735703.2735708
Gottlob GOrsi GPieris A(2014)Query Rewriting and Optimization for Ontological DatabasesACM Transactions on Database Systems10.1145/263854639:3(1-46)Online publication date: 7-Oct-2014
https://dl.acm.org/doi/10.1145/2638546
Konstantinidis GAmbite JDe Virgilio RGiunchiglia FTanca L(2013)Scalable containment for unions of conjunctive queries under constraintsProceedings of the Fifth Workshop on Semantic Web Information Management10.1145/2484712.2484716(1-8)Online publication date: 23-Jun-2013
https://dl.acm.org/doi/10.1145/2484712.2484716
Konstantinidis GAmbite J(2012)Towards scalable data integration under constraintsProceedings of the 2012 Joint EDBT/ICDT Workshops10.1145/2320765.2320835(251-256)Online publication date: 30-Mar-2012
https://dl.acm.org/doi/10.1145/2320765.2320835
Gardezi JBertossi L(2012)Query rewriting using datalog for duplicate resolutionProceedings of the Second international conference on Datalog in Academia and Industry10.1007/978-3-642-32925-8_10(86-98)Online publication date: 11-Sep-2012
https://dl.acm.org/doi/10.1007/978-3-642-32925-8_10

View Options

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Media

Figures

Other

Tables

View Issue’s Table of Contents