Эта публикация цитируется в 14 статьях

Ontology-mediated queries: Combined complexity and succinctness of rewritings via circuit complexity

Meghyn Bienvenu^a, Stanislav Kikot^b, Roman Kontchakov^b, Vladimir V. Podolskii^cd, Michael Zakharyaschev<sup>b

a</sup> 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

Язык публикации: английский

DOI: 10.1145/3191832

Реферативные базы данных:

• 
• 
•