On the entailment problem for DL-Lite$_{core}$ ontologies and conjunctive queries with negation
Fuente:
arXiv
Saved in:
| Main Authors: | Marcinkowski, Jerzy, Ostropolski-Nalewaja, Piotr |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
About the Multi-Head Linear Restricted Chase Termination
by: Gerlach, Lukas, et al.
Published: (2025)
by: Gerlach, Lukas, et al.
Published: (2025)
Decidability of Quasi-Dense Modal Logics
by: Ostropolski-Nalewaja, Piotr, et al.
Published: (2024)
by: Ostropolski-Nalewaja, Piotr, et al.
Published: (2024)
Foundations for an Abstract Proof Theory in the Context of Horn Rules
by: Lyon, Tim S., et al.
Published: (2023)
by: Lyon, Tim S., et al.
Published: (2023)
The Sticky Path to Expressive Querying: Decidability of Navigational Queries under Existential Rules
by: Ostropolski-Nalewaja, Piotr, et al.
Published: (2024)
by: Ostropolski-Nalewaja, Piotr, et al.
Published: (2024)
Decidability of Querying First-Order Theories via Countermodels of Finite Width
by: Feller, Thomas, et al.
Published: (2023)
by: Feller, Thomas, et al.
Published: (2023)
Bag Semantics Query Containment: The CQ vs. UCQ Case and Other Stories
by: Marcinkowski, Jerzy, et al.
Published: (2025)
by: Marcinkowski, Jerzy, et al.
Published: (2025)
Towards Practicable Algorithms for Rewriting Graph Queries beyond DL-Lite
by: Löhnert, Bianca, et al.
Published: (2024)
by: Löhnert, Bianca, et al.
Published: (2024)
Enumeration and updates for conjunctive linear algebra queries through expressibility
by: Muñoz, Thomas, et al.
Published: (2023)
by: Muñoz, Thomas, et al.
Published: (2023)
A Horn extension of DL-Lite with NL data complexity
by: Arpasi, Janos, et al.
Published: (2026)
by: Arpasi, Janos, et al.
Published: (2026)
Can Large Language Models Understand DL-Lite Ontologies? An Empirical Study
by: Wang, Keyu, et al.
Published: (2024)
by: Wang, Keyu, et al.
Published: (2024)
Strong negation in the theory of computable functionals TCF
by: Köpp, Nils, et al.
Published: (2022)
by: Köpp, Nils, et al.
Published: (2022)
Further remarks on the dual negation in team logics
by: Anttila, Aleksi
Published: (2024)
by: Anttila, Aleksi
Published: (2024)
Intrinsic and relative characterization results for logics with negative modalities
by: de Groot, Jim, et al.
Published: (2025)
by: de Groot, Jim, et al.
Published: (2025)
Rethinking meaning and ontologies from the perspective of ontological units
by: Fabry, Paul, et al.
Published: (2025)
by: Fabry, Paul, et al.
Published: (2025)
Iof-maint -- Modular maintenance ontology
by: Hodkiewicz, Melinda, et al.
Published: (2024)
by: Hodkiewicz, Melinda, et al.
Published: (2024)
A fuzzy loss for ontology classification
by: Flügel, Simon, et al.
Published: (2024)
by: Flügel, Simon, et al.
Published: (2024)
Synthesizing nested relational queries from implicit specifications: via model theory and via proof theory
by: Benedikt, Michael, et al.
Published: (2022)
by: Benedikt, Michael, et al.
Published: (2022)
Lattice-preserving $\mathcal{ALC}$ ontology embeddings with saturation
by: Zhapa-Camacho, Fernando, et al.
Published: (2023)
by: Zhapa-Camacho, Fernando, et al.
Published: (2023)
A C++ reasoner for the description logic $\mathcal{DL}_{\mathbf{D}}^{4,\!\times}$ (Extended Version)
by: Cantone, Domenico, et al.
Published: (2017)
by: Cantone, Domenico, et al.
Published: (2017)
A set-based reasoner for the description logic $\mathcal{DL}_{\mathbf{D}}^{4,\!\times}$ (Extended Version)
by: Cantone, Domenico, et al.
Published: (2018)
by: Cantone, Domenico, et al.
Published: (2018)
Automated planning with ontologies under coherence update semantics (Extended Version)
by: Borgwardt, Stefan, et al.
Published: (2025)
by: Borgwardt, Stefan, et al.
Published: (2025)
Recursive querying of neural networks via weighted structures
by: Grohe, Martin, et al.
Published: (2026)
by: Grohe, Martin, et al.
Published: (2026)
An optimized KE-tableau-based system for reasoning in the description logic $\mathcal{DL}_{\mathbf{D}}^{4,\!\times}$ (Extended Version)
by: Cantone, Domenico, et al.
Published: (2018)
by: Cantone, Domenico, et al.
Published: (2018)
Did Turing prove the undecidability of the halting problem?
by: Hamkins, Joel David, et al.
Published: (2024)
by: Hamkins, Joel David, et al.
Published: (2024)
Towards an ontology of state actors in cyberspace
by: De Colle, Giacomo
Published: (2024)
by: De Colle, Giacomo
Published: (2024)
There are (other) ways to negate in propositional team semantics
by: Yang, Fan
Published: (2024)
by: Yang, Fan
Published: (2024)
Tree transducers of linear size-to-height increase (and the additive conjunction of linear logic)
by: Dartois, Luc, et al.
Published: (2026)
by: Dartois, Luc, et al.
Published: (2026)
Complexity of the Model Checking problem for inquisitive propositional and modal logic
by: Grilletti, Gianluca, et al.
Published: (2024)
by: Grilletti, Gianluca, et al.
Published: (2024)
Non-negative Rational Semantic Numeration Systems
by: Chunikhin, Alexander
Published: (2026)
by: Chunikhin, Alexander
Published: (2026)
WATCHDOG: an ontology-aWare risk AssessmenT approaCH via object-oriented DisruptiOn Graphs
by: Nicoletti, Stefano M., et al.
Published: (2024)
by: Nicoletti, Stefano M., et al.
Published: (2024)
Logics with probabilistic team semantics and the Boolean negation
by: Hannula, Miika, et al.
Published: (2023)
by: Hannula, Miika, et al.
Published: (2023)
The structure of polynomial growth for tree automata/transducers and MSO set queries
by: Gallot, Paul, et al.
Published: (2025)
by: Gallot, Paul, et al.
Published: (2025)
RustyDL: A Program Logic for Rust
by: Drodt, Daniel, et al.
Published: (2026)
by: Drodt, Daniel, et al.
Published: (2026)
Filter-induced entailment relations in paraconsistent Gödel logics
by: Frittella, Sabine, et al.
Published: (2024)
by: Frittella, Sabine, et al.
Published: (2024)
On the Complexity of the Skolem Problem at Low Orders
by: Bacik, Piotr, et al.
Published: (2025)
by: Bacik, Piotr, et al.
Published: (2025)
A formal query language and automata model for aggregation in complex event recognition
by: Bourhis, Pierre, et al.
Published: (2026)
by: Bourhis, Pierre, et al.
Published: (2026)
Approaching the Conway-99 problem using SAT solvers
by: Keramatipour, Ali
Published: (2026)
by: Keramatipour, Ali
Published: (2026)
Fully Abstract Encodings of $λ$-Calculus in HOcore through Abstract Machines
by: Biernacka, Małgorzata, et al.
Published: (2022)
by: Biernacka, Małgorzata, et al.
Published: (2022)
On the Subspace Orbit Problem and the Simultaneous Skolem Problem
by: Bacik, Piotr, et al.
Published: (2026)
by: Bacik, Piotr, et al.
Published: (2026)
Formal Verification of Probabilistic Multi-Agent Systems for Ballistic Rocket Flight Using Probabilistic Alternating-Time Temporal Logic
by: Kurpiewski, Damian, et al.
Published: (2025)
by: Kurpiewski, Damian, et al.
Published: (2025)
Similar Items
-
About the Multi-Head Linear Restricted Chase Termination
by: Gerlach, Lukas, et al.
Published: (2025) -
Decidability of Quasi-Dense Modal Logics
by: Ostropolski-Nalewaja, Piotr, et al.
Published: (2024) -
Foundations for an Abstract Proof Theory in the Context of Horn Rules
by: Lyon, Tim S., et al.
Published: (2023) -
The Sticky Path to Expressive Querying: Decidability of Navigational Queries under Existential Rules
by: Ostropolski-Nalewaja, Piotr, et al.
Published: (2024) -
Decidability of Querying First-Order Theories via Countermodels of Finite Width
by: Feller, Thomas, et al.
Published: (2023)