Tractable query answering and rewriting under description logic constraints (Q975872): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / Wikidata QID
 
Property / Wikidata QID: Q56988673 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4864249 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2751360 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2751353 / 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: Tightly Integrated Probabilistic Description Logic Programs for Representing Ontology Mappings / 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: Q4414536 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4863622 / rank
 
Normal rank
Property / cites work
 
Property / cites work: First-order query rewriting for inconsistent databases / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5649989 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Resolution Strategies as Decision Procedures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Logical foundations of object-oriented and frame-based languages / 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: Answering queries using views: A survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rewriting Conjunctive Queries over Description Logic Knowledge Bases / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2724150 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the finite controllability of conjunctive query answering in databases under open-world assumption / rank
 
Normal rank
Property / cites work
 
Property / cites work: $\mathbb{FDNC}$ : Decidable Non-monotonic Disjunctive Logic Programs with Function Symbols / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4400807 / rank
 
Normal rank

Latest revision as of 22:38, 2 July 2024

scientific article
Language Label Description Also known as
English
Tractable query answering and rewriting under description logic constraints
scientific article

    Statements

    Tractable query answering and rewriting under description logic constraints (English)
    0 references
    0 references
    0 references
    0 references
    11 June 2010
    0 references
    0 references
    description logics
    0 references
    incomplete databases
    0 references
    query answering
    0 references
    query rewriting
    0 references
    0 references
    0 references