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

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,628

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

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.
Datalog rewritability of Disjunctive Datalog programs and non-Horn ontologies.Mark Kaminski, Yavor Nenov & Bernardo Cuenca Grau - 2016 - Artificial Intelligence 236 (C):90-118.
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.
Logical foundations and complexity of 4QL, a query language with unrestricted negation.Jan Maluszyński & Andrzej Szalas - 2011 - Journal of Applied Non-Classical Logics 21 (2):211-232.
Hierarchies in transitive closure logic, stratified Datalog and infinitary logic.Erich Grädel & Gregory L. McColm - 1996 - Annals of Pure and Applied Logic 77 (2):169-199.
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.
Presburger arithmetic with unary predicates is Π11 complete.Joseph Y. Halpern - 1991 - Journal of Symbolic Logic 56 (2):637 - 642.
Guarded Ontology-Mediated Queries.Pablo Barceló, Gerald Berger, Georg Gottlob & Andreas Pieris - 2021 - In Judit Madarász & Gergely Székely (eds.), Hajnal Andréka and István Németi on Unity of Science: From Computing to Relativity Theory Through Algebraic Logic. Springer. pp. 27-52.
Theory discovery from data with mixed quantifiers.Kevin T. Kelly & Clark Glymour - 1990 - Journal of Philosophical Logic 19 (1):1 - 33.
The Logic of Description and Valuation.Robert S. Hartman - 1960 - Review of Metaphysics 14 (2):191 - 230.
Why Logically Equivalent Predicates May Pick out Different Properties.Elliott Sober - 1982 - American Philosophical Quarterly 19 (2):183-189.
Syntactical truth predicates for second order arithmetic.Loïc Colson & Serge Grigorieff - 2001 - Journal of Symbolic Logic 66 (1):225-256.
The Many Uses of Predicates of Taste and the Challenge from Disagreement.Dan Zeman - 2016 - Studies in Logic, Grammar and Rhetoric 46 (1):79-101.
Syntactical truth predicates for second order arithmetic.Loïc Colson & Serge Grigorieff - 2001 - Journal of Symbolic Logic 66 (1):225-256.
Stabilité polynômiale Des corps différentiels.Natacha Portier - 1999 - Journal of Symbolic Logic 64 (2):803-816.

Analytics

Added to PP
2024-02-24

Downloads
4 (#1,619,050)

6 months
4 (#775,606)

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