This article is cited in 6 papers

Tree-like Queries in OWL 2 QL: Succinctness and Complexity Results

Meghyn Bienvenu^a, Stanislav Kikot^bc, Vladimir V. Podolskii<sup>de

a</sup> Laboratoire de Recherche en Informatique, CNRS & Université Paris-Sud, Orsay, France
^b Institute for Information Transmission Problems, Moscow, Russia
^c MIPT, Moscow, Russia
^d Steklov Mathematical Institute, Moscow, Russia
^e National Research University Higher School of Economics, Moscow, Russia

Language: English

DOI: 10.1109/LICS.2015.38

Bibliographic databases:

• 
• 

ArXiv: 1406.3047