The Complexity of Conjunctive Query Answering in Expressive Description Logics (Q3541701): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/978-3-540-71070-7_16 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1483388050 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4406531 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Alternation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3624113 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4938424 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2723446 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5715707 / 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

Latest revision as of 20:26, 28 June 2024

scientific article
Language Label Description Also known as
English
The Complexity of Conjunctive Query Answering in Expressive Description Logics
scientific article

    Statements

    The Complexity of Conjunctive Query Answering in Expressive Description Logics (English)
    0 references
    0 references
    27 November 2008
    0 references

    Identifiers