Datalog rewritability and data complexity of ALCHOIQ with closed predicates

, &
Artificial Intelligence 330 (C):104099 (2024)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.1016/j.artint.2024.104099

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 101,505

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

My notes

Similar books and articles

Datalog rewritability of Disjunctive Datalog programs and non-Horn ontologies.Mark Kaminski, Yavor Nenov & Bernardo Cuenca Grau - 2016 - Artificial Intelligence 236 (C):90-118.
Polynomial rewritings from expressive Description Logics with closed predicates to variants of Datalog.Shqiponja Ahmetaj, Magdalena Ortiz & Mantas Šimkus - 2020 - Artificial Intelligence 280 (C):103220.
A complete classification of the complexity and rewritability of ontology-mediated queries based on the description logic EL.Carsten Lutz & Leif Sabellek - 2022 - Artificial Intelligence 308 (C):103709.
Modular materialisation of Datalog programs.Pan Hu, Boris Motik & Ian Horrocks - 2022 - Artificial Intelligence 308 (C):103726.
Maintenance of datalog materialisations revisited.Boris Motik, Yavor Nenov, Robert Piro & Ian Horrocks - 2019 - Artificial Intelligence 269 (C):76-136.
Magic Sets for disjunctive Datalog programs.Mario Alviano, Wolfgang Faber, Gianluigi Greco & Nicola Leone - 2012 - Artificial Intelligence 187-188 (C):156-192.
On the query complexity of selecting minimal sets for monotone predicates.Mikoláš Janota & Joao Marques-Silva - 2016 - Artificial Intelligence 233 (C):73-83.
Deciding the bisimilarity relation between datalog goals.Philippe Balbiani & Antoun Yaacoub - 2012 - In Luis Farinas del Cerro, Andreas Herzig & Jerome Mengin (eds.), Logics in Artificial Intelligence. Springer. pp. 67--79.
First-order rewritability of ontology-mediated queries in linear temporal logic.Alessandro Artale, Roman Kontchakov, Alisa Kovtunova, Vladislav Ryzhikov, Frank Wolter & Michael Zakharyaschev - 2021 - Artificial Intelligence 299 (C):103536.
The Expressive Power of Revised Datalog on Problems with Closure Properties.Shiguang Feng - 2023 - In Natasha Alechina, Andreas Herzig & Fei Liang (eds.), Logic, Rationality, and Interaction: 9th International Workshop, LORI 2023, Jinan, China, October 26–29, 2023, Proceedings. Springer Nature Switzerland. pp. 109-125.

Analytics

Added to PP
2024-02-24

Downloads
14 (#1,280,710)

6 months
9 (#495,347)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

Complexity of the two-variable fragment with counting quantifiers.Ian Pratt-Hartmann - 2005 - Journal of Logic, Language and Information 14 (3):369-395.

View all 7 references / Add more references