|
This article is cited in 14 scientific papers (total in 14 papers)
Ontology-mediated queries: Combined complexity and succinctness of rewritings via circuit complexity
Meghyn Bienvenua, Stanislav Kikotb, Roman Kontchakovb, Vladimir V. Podolskiicd, Michael Zakharyaschevb a Laboratoire d'Informatique, de Robotique et de Microélectronique de Montpellier (LIRMM), University of Montpellier, 860 rue de St Priest, Montpellier Cedex 5, 34095, France
b Department of Computer Science and Information Systems, Birkbeck, University of London, Malet Street, London, WC1E 7HX, United Kingdom
c Steklov Mathematical Institute, Russian Academy of Sciences, 8 Gubkina str., Moscow, 119991, Russian Federation
d Steklov Mathematical Institute, Russian Academy of Sciences, 8 Gubkina str., Moscow, 119991, Russian Federation
Linking options:
https://www.mathnet.ru/eng/jacm2
|
Statistics & downloads: |
Abstract page: | 62 |
|