Polynomial rewritings from expressive description logics with closed predicates to variants of Datalog (Q2302291): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Polynomial rewritings from expressive description logics with closed predicates to variants of Datalog / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3305347 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Description Logic Handbook / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rewriting Guarded Negation Queries / rank
 
Normal rank
Property / cites work
 
Property / cites work: Querying Visible and Invisible Information / 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: Regular Path Queries in Lightweight Description Logics: Complexity and Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ontology-Based Data Access / 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: Data complexity of query answering in description logics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Answering regular path queries in expressive description logics via alternating tree-automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Capturing Missing Tuples and Missing Values / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combining answer set programming with description logics for the semantic web / rank
 
Normal rank
Property / cites work
 
Property / cites work: Conjunctive query answering in the description logic \(\mathcal S \mathcal H\) using knots / rank
 
Normal rank
Property / cites work
 
Property / cites work: Query Answering with DBoxes is Hard / rank
 
Normal rank
Property / cites work
 
Property / cites work: The price of query rewriting in ontology-based data access / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combining decidability paradigms for existential rules / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reasoning in description logics by a reduction to disjunctive datalog / rank
 
Normal rank
Property / cites work
 
Property / cites work: Datalog rewritability of disjunctive Datalog programs and non-Horn ontologies / 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: Q5232905 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reconciling description logics and rules / 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: Q4012244 / rank
 
Normal rank

Latest revision as of 22:03, 21 July 2024

scientific article
Language Label Description Also known as
English
Polynomial rewritings from expressive description logics with closed predicates to variants of Datalog
scientific article

    Statements

    Polynomial rewritings from expressive description logics with closed predicates to variants of Datalog (English)
    0 references
    0 references
    0 references
    0 references
    26 February 2020
    0 references
    description logics
    0 references
    Datalog
    0 references
    closed predicates
    0 references
    ontology-mediated query answering
    0 references
    query rewriting
    0 references
    succinctness
    0 references
    relative expressiveness
    0 references
    0 references
    0 references
    0 references

    Identifiers

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