|
|
"Algorithmic problems in algebra and logic" (S.I.Adian seminar)
April 16, 2013 18:30–20:05, Moscow, Steklov Mathematical Institute
|
 |
|
 |
|
|
|
On the length of conjunctive query rewritings for OWL 2 QL theories
S. P. Kikot' |
| Number of views: |
| This page: | 172 |
|
Abstract:
We establish a connection between circuit complexity and the problem
of constructing short rewritings of conjunctive queries for OWL 2 QL
(first-order theories of some special form) and its fragments, and
exploit it for proving upper and lower bounds for the length of query
rewritings.
|
|
Contact us: