Document Open Access Logo

Fine-Grained Complexity of Ontology Mediated Queries (Invited Paper)

Author Cristina Feier

PDF

File

Thumbnail PDF
PDF
OASIcs.RW.2024-2025.2.pdf
  • Filesize: 1.18 MB
  • 23 pages

Document Identifiers

Subject Classification

ACM Subject Classification
  • Theory of computation → Logic
  • Theory of computation → Automated reasoning
  • Theory of computation → Description logics
  • Theory of computation → Parameterized complexity and exact algorithms
  • Information systems → Query languages
Keywords
  • complexity analysis
  • guarded logics
  • guarded tgds
  • database theory
  • ontology mediated queries

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads
    0
    Metadata Views

Abstract

This article surveys some approaches for establishing fine-grained complexity results for evaluation of ontology mediated queries (OMQs). It accompanies a related talk given at the Reasoning Web Summer School 2024. It zooms into some characterizations of efficiency in a parameterized complexity framework for OMQs based on various description logics and guarded tgds. As such results were established using results from query evaluation on databases, it also discusses the relevant results from the database world. After surveying some successive results on OMQs which all leverage database results in custom ways, it describes an approach which provides a general fpt reduction from query evaluation in the database world to query evaluation in the OMQ world. The reduction enables porting hardness results from the DB world to the OMQ world in a black-box fashion. Along these mentioned approaches, it also provides a brief survey of other approaches which are concerned with fine-grained complexity of OMQs and are based on rewriting techniques.

Cite As Get BibTex

Cristina Feier. Fine-Grained Complexity of Ontology Mediated Queries (Invited Paper). In Joint Proceedings of the 20th and 21st Reasoning Web Summer Schools (RW 2024 & RW 2025). Open Access Series in Informatics (OASIcs), Volume 138, pp. 2:1-2:23, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025) https://doi.org/10.4230/OASIcs.RW.2024/2025.2

Author Details

Cristina Feier
  • Technical University of Cluj-Napoca, Romania

Funding

This work is supported by the project "Romanian Hub for Artificial Intelligence-HRIA", Smart Growth, Digitization and Financial Instruments Program, MySMIS no. 334906.

Acknowledgements

I want to thank the anonymous reviewer for the very helpful comments.

References

  1. Franz Baader, Diego Calvanese, Deborah L. McGuinness, Daniele Nardi, and Peter F. Patel-Schneider, editors. The Description Logic Handbook: Theory, Implementation, and Applications, 2003. Google Scholar
  2. Franz Baader, Carsten Lutz, Heike Sturm, and Frank Wolter. Fusions of description logics and abstract description systems. arXiv, 2011. URL: https://arxiv.org/abs/1106.1802.
  3. Pablo Barceló, Victor Dalmau, Cristina Feier, Carsten Lutz, and Andreas Pieris. The limits of efficiency for open- and closed-world query evaluation under guarded tgds. In 39th ACM Symposium on Principles of Database Systems (PODS-20). ACM Press, 2020. Google Scholar
  4. Pablo Barceló, Cristina Feier, Carsten Lutz, and Andreas Pieris. When is ontology-mediated querying efficient? In Thirty-Fourth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), 2019. Google Scholar
  5. Pablo Barceló, Leonid Libkin, Anthony W. Lin, and Peter T. Wood. Expressive languages for path queries over graph-structured data. ACM Trans. Database Syst., 37(4), 2012. URL: https://doi.org/10.1145/2389241.2389250.
  6. Pablo Barceló, Jorge Pérez, and Juan L. Reutter. Relative expressiveness of nested regular expressions. In Proc. of the 6th Alberto Mendelzon International Workshop on Foundations of Data Management, June 27-30, 2012, volume 866, pages 180-195. CEUR-WS.org, 2012. URL: https://ceur-ws.org/Vol-866/paper13.pdf.
  7. Pablo Barceló, Miguel Romero, and Moshe Y. Vardi. Semantic acyclicity on graph databases. SIAM Journal on Computing, 45(4):1339-1376, 2016. URL: https://doi.org/10.1137/15M1034714.
  8. Jonathan Berant, Andrew Chou, Roy Frostig, and Percy Liang. Semantic parsing on freebase from question-answer pairs. In Proceedings of the 2013 Conference on Empirical Methods in Natural Language Processing (EMNLP), pages 1533-1544. Association for Computational Linguistics, 2013. URL: https://doi.org/10.18653/V1/D13-1160.
  9. Tim Berners-Lee, James Hendler, and Ora Lassila. The semantic web. Scientific American, 284(5):28-37, 2001. Google Scholar
  10. Meghyn Bienvenu, Balder ten Cate, Carsten Lutz, and Frank Wolter. Ontology-based data access: A study through disjunctive datalog, csp, and MMSNP. ACM Trans. Database Syst., 39(4):33:1-33:44, 2014. URL: https://doi.org/10.1145/2661643.
  11. Manuel Bodirsky. Cores of structures and constraint satisfaction problems. Theoretical Computer Science, 412(18):1898-1910, 2011. URL: https://doi.org/10.1016/j.tcs.2010.12.017.
  12. Andrea Calì, Georg Gottlob, and Michael Kifer. Taming the infinite chase: Query answering under expressive relational constraints. J. Artif. Intell. Res., 48:115-174, 2013. URL: https://doi.org/10.1613/JAIR.3873.
  13. Andrea Calì, Georg Gottlob, and Thomas Lukasiewicz. Datalog±: a unified approach to ontologies and integrity constraints. In ICDT, pages 14-30, 2009. URL: https://doi.org/10.1145/1514894.1514897.
  14. Ashok K. Chandra and David Harel. Structure and complexity of relational queries. Journal of Computer and System Sciences, 25(1):99-128, 1982. URL: https://doi.org/10.1016/0022-0000(82)90004-7.
  15. Ashok K. Chandra and Philip M. Merlin. Optimal implementation of conjunctive queries in relational data bases. In STOC, pages 77-90, 1977. URL: https://doi.org/10.1145/800105.803397.
  16. Chandra Chekuri and Anand Rajaraman. Conjunctive query containment revisited. Theor. Comput. Sci., 239(2):211-229, 2000. URL: https://doi.org/10.1016/S0304-3975(99)00220-0.
  17. Hubie Chen, Georg Gottlob, Matthias Lanzinger, and Reinhard Pichler. Semantic width and the fixed-parameter tractability of constraint satisfaction problems. In Christian Bessiere, editor, IJCAI, pages 1726-1733, 2020. URL: https://doi.org/10.24963/IJCAI.2020/239.
  18. Hubie Chen and Stefan Mengel. A Trichotomy in the Complexity of Counting Answers to Conjunctive Queries. In (ICDT 2015), volume 31, pages 110-126, 2015. URL: https://doi.org/10.4230/LIPICS.ICDT.2015.110.
  19. Alin Deutsch, Alan Nash, and Jeff B. Remmel. The chase revisisted. In PODS, pages 149-158, 2008. Google Scholar
  20. Rodney G. Downey and Michael R. Fellows. Fixed-parameter tractability and completeness I: basic results. SIAM Journal on Computing, 24:873-921, 1995. URL: https://doi.org/10.1137/S0097539792228228.
  21. Cristina Feier. Characterising Fixed Parameter Tractability for Query Evaluation Over Guarded TGDs. In ICDT, volume 220, pages 12:1-12:22, 2022. Google Scholar
  22. Cristina Feier, Tomasz Gogacz, and Filip Murlak. Evaluating graph queries using semantic treewidth. In 27th International Conference on Database Theory, volume 290, pages 22:1-22:20, 2024. URL: https://doi.org/10.4230/LIPICS.ICDT.2024.22.
  23. Cristina Feier, Antti Kuusisto, and Carsten Lutz. Rewritability in monadic disjunctive datalog, mmsnp, and expressive description logics. Logical Methods in Computer Science, 15(2):15:1-15:46, 2019. URL: https://doi.org/10.23638/LMCS-15(2:15)2019.
  24. Cristina Feier, Carsten Lutz, and Marcin Przybyłko. Answer Counting Under Guarded TGDs. In Ke Yi and Zhewei Wei, editors, 24th International Conference on Database Theory (ICDT 2021), volume 186, pages 11:1-11:22, 2021. URL: https://doi.org/10.4230/LIPICS.ICDT.2021.11.
  25. Cristina Feier, Carsten Lutz, and Frank Wolter. From conjunctive queries to instance queries in ontology-mediated querying. In Proceedings of the 27th International Joint Conference on Artificial Intelligence (IJCAI-ECAI 2018). AAAI Press, 2018. Google Scholar
  26. Diego Figueira and Rémi Morvan. Approximation and Semantic Tree-width of Conjunctive Regular Path Queries. In 26th International Conference on Database Theory, Ioannina, Greece, 2023. URL: https://hal.archives-ouvertes.fr/hal-03883042.
  27. Georg Gottlob, Nicola Leone, and Francesco Scarcello. Hypertree decompositions and tractable queries. Journal of Computer and System Sciences, 64(3):579-627, 2002. URL: https://doi.org/10.1006/JCSS.2001.1809.
  28. Martin Grohe. The complexity of homomorphism and constraint satisfaction problems seen from the other side. J. ACM, 54(1):1:1-1:24, 2007. URL: https://doi.org/10.1145/1206035.1206036.
  29. Martin Grohe and Dániel Marx. Constraint solving via fractional edge covers. ACM Trans. Algorithms, 11(1), August 2014. URL: https://doi.org/10.1145/2636918.
  30. Thomas R. Gruber. A translation approach to portable ontology specifications. Knowledge Acquisition, 5(2):199-220, 1993. URL: https://doi.org/10.1006/knac.1993.1008.
  31. Lingxiao Guo and et al. Text2sparql: Neural semantic parsing for knowledge graph question answering. In Proceedings of AAAI, 2022. Google Scholar
  32. Wilfrid Hodges. Model Theory, volume 42 of Encyclopedia of Mathematics and its Applications. Cambridge University Press, 1993. Google Scholar
  33. Thomas Hofweber. Ontology. In Edward N. Zalta, editor, The Stanford Encyclopedia of Philosophy. Metaphysics Research Lab, Stanford University, fall 2021 edition, 2021. Google Scholar
  34. Russell Impagliazzo, Ramamohan Paturi, and Francis Zane. Which problems have strongly exponential complexity? J. Comput. Syst. Sci., 63(4):512-530, 2001. URL: https://doi.org/10.1006/JCSS.2001.1774.
  35. David S. Johnson and Anthony C. Klug. Testing containment of conjunctive queries under functional and inclusion dependencies. J. Comput. Syst. Sci., 28(1):167-189, 1984. URL: https://doi.org/10.1016/0022-0000(84)90081-3.
  36. Stanislav Kikot and Evgeny Zolin. Modal definability of first-order formulas with free variables and query answering. J. Applied Logic, 11(2):190-216, 2013. URL: https://doi.org/10.1016/J.JAL.2013.03.007.
  37. Patrick Lewis, Ethan Perez, Aleksandra Piktus, Fabio Petroni, Vladimir Karpukhin, Naman Goyal, Heinrich Küttler, Mike Lewis, Wen tau Yih, Tim Rocktäschel, Sebastian Riedel, and Douwe Kiela. Retrieval-augmented generation for knowledge-intensive nlp tasks. In Advances in Neural Information Processing Systems (NeurIPS), 2020. URL: https://arxiv.org/abs/2005.11401.
  38. Carsten Lutz. Non-uniform data complexity of query answering in description logics. In Proceedings of the 13th International Conference on Principles of Knowledge Representation and Reasoning (KR 2012), pages 276-286, 2012. Google Scholar
  39. Carsten Lutz and Marcin Przybylko. Efficiently enumerating answers to ontology-mediated queries. In PODS '22: International Conference on Management of Data, pages 277-289, 2022. URL: https://doi.org/10.1145/3517804.3524166.
  40. Carsten Lutz and Marcin Przybylko. Efficient answer enumeration in description logics with functional roles. In Thirty-Seventh AAAI Conference on Artificial Intelligence, AAAI, pages 6483-6490, 2023. URL: https://doi.org/10.1609/AAAI.V37I5.25797.
  41. Carsten Lutz, Leif Sabellek, and Lukas Schulze. Ontology-mediated querying on databases of bounded cliquewidth. In Proc. of the 19th International Conference on Principles of Knowledge Representation and Reasoning, KR, 2022. Google Scholar
  42. David Maier, Alberto O. Mendelzon, and Yehoshua Sagiv. Testing implications of data dependencies. ACM Trans. Database Syst., 4(4):455-469, 1979. URL: https://doi.org/10.1145/320107.320115.
  43. Dániel Marx. Tractable hypergraph properties for constraint satisfaction and conjunctive queries. In STOC, pages 735-744, 2010. URL: https://doi.org/10.1145/1806689.1806790.
  44. Marvin Minsky. A Framework for Representing Knowledge. MIT AI Laboratory, Memo 306, 1975. Also published in *The Psychology of Computer Vision*, P.H. Winston (Ed.), 1975, McGraw-Hill. Google Scholar
  45. W3C OWL Working Group. OWL 2 Web Ontology Language: Document Overview. W3C Recommendation, 2009. Available at URL: http://www.w3.org/TR/owl2-overview/.
  46. Miguel Romero, Pablo Barceló, and Moshe Y. Vardi. The homomorphism problem for regular graph patterns. In 2017 32nd Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), pages 1-12, 2017. URL: https://doi.org/10.1109/LICS.2017.8005106.
  47. Kartik Sharma, Peeyush Kumar, and Yunqing Li. Og-rag: Ontology-grounded retrieval-augmented generation for large language models. arXiv preprint arXiv:2412.15235, 2024. URL: https://doi.org/10.48550/arXiv.2412.15235.
  48. Mihalis Yannakakis. Algorithms for acyclic database schemes. In VLDB, pages 82-94, 1981. Google Scholar
  49. Wen-tau Yih, Ming-Wei Chang, Xiaodong He, and Jianfeng Gao. Question answering over freebase with multi-column convolutional neural networks. arXiv preprint arXiv:1609.07843, 2016. Google Scholar
Any Issues?
X

Feedback on the Current Page

CAPTCHA

Thanks for your feedback!

Feedback submitted to Dagstuhl Publishing

Could not send message

Please try again later or send an E-mail
© 2023-2025 Schloss Dagstuhl – LZI GmbH About DROPS Imprint Privacy Contact