Answering regular path queries in expressive description logics via alternating tree-automata (Q2252521)

From MaRDI portal
Revision as of 19:12, 8 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Answering regular path queries in expressive description logics via alternating tree-automata
scientific article

    Statements

    Answering regular path queries in expressive description logics via alternating tree-automata (English)
    0 references
    0 references
    0 references
    0 references
    18 July 2014
    0 references
    expressive description logics
    0 references
    query answering
    0 references
    computational complexity
    0 references
    automata on infinite trees
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    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
    0 references