A complete classification of the complexity and rewritability of ontology-mediated queries based on the description logic \(\mathcal{EL}\) (Q2144172): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Ontologies and Databases: The DL-Lite Approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ontology-Based Data Access / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ontology-Mediated Query Answering with Data-Tractable Description Logics / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Introduction to Description Logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Data Complexity in the $\mathcal{EL}$ Family of Description Logics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Data complexity of query answering in description logics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5377468 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tractable query answering and rewriting under description logic constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear Datalog and Bounded Path Duality of Relational Structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Majority constraints have bounded pathwidth duality / rank
 
Normal rank
Property / cites work
 
Property / cites work: CSP duality and trees of bounded pathwidth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tractable reasoning and efficient query answering in description logics: The DL-Lite family / rank
 
Normal rank
Property / cites work
 
Property / cites work: PREDICATE BOUNDEDNESS OF LINEAR MONADIC DATALOG IS IN PSPACE / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of Boundedness for Guarded Logics / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Computational Structure of Monotone Monadic SNP and Constraint Satisfaction: A Study through Datalog and Group Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5232905 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4864249 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deciding inseparability and conservative extensions in the description logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Taming the Infinite Chase: Query Answering under Expressive Relational Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of Conjunctive Query Answering in Expressive Description Logics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dualities for Constraint Satisfaction Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4227581 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4734768 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Transforming Two-Way Alternating Finite Automata to One-Way Nondeterministic Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Alternating automata on infinite trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4219045 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Query Answering in the Description Logic Horn- $\mathcal{SHIQ}$ / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4643956 / rank
 
Normal rank

Revision as of 04:10, 29 July 2024

scientific article
Language Label Description Also known as
English
A complete classification of the complexity and rewritability of ontology-mediated queries based on the description logic \(\mathcal{EL}\)
scientific article

    Statements

    A complete classification of the complexity and rewritability of ontology-mediated queries based on the description logic \(\mathcal{EL}\) (English)
    0 references
    0 references
    0 references
    1 June 2022
    0 references
    description logic
    0 references
    ontology-mediated querying
    0 references
    complexity classification
    0 references
    rewritability
    0 references
    linear Datalog
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references