Answering regular path queries in expressive description logics via alternating tree-automata (Q2252521): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Created claim: Wikidata QID (P12): Q64360035, #quickstatements; #temporary_batch_1707252663060 |
||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q64360035 / rank | |||
Normal rank | |||
Revision as of 02:40, 7 February 2024
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
18 July 2014
0 references
expressive description logics
0 references
query answering
0 references
computational complexity
0 references
automata on infinite trees
0 references
