Meghyn Bienvenu, Stanislav Kikot, Vladimir V. Podolskii, “Tree-like Queries in OWL 2 QL: Succinctness and Complexity Results”, Logic in Computer Science, 2015, Pages 317

Logic in Computer Science

RUS ENG

JavaScript is disabled in your browser. Please switch it on to enable full functionality of the website

Logic in Computer Science, 2015, Pages 317–328
DOI: https://doi.org/10.1109/LICS.2015.38 (Mi lics1)

Citations (6)

DOI: https://doi.org/10.1109/LICS.2015.38

Funding agency	Grant number
Agence Nationale de la Recherche	12-JS02-007-01
Russian Foundation for Basic Research
Ministry of Education and Science of the Russian Federation
Russian Science Foundation	14-50-00150
M. Bienvenu was supported by the ANR (project 12-JS02-007-01), and V. Podolskii by the Russian Foundation for Basic Research and the programme "Leading Scientific Schools". S. Kikot carried out his research at IITP at the expense of the Russian Foundation for Sciences (project No. 14-50-00150).

Bibliographic databases:

Document Type: Article

Language: English

Linking options:

https://www.mathnet.ru/eng/lics1

Related presentations:

This publication is cited in the following 6 articles:

Citing articles in Google Scholar: Russian citations, English citations
Related articles in Google Scholar: Russian articles, English articles

Statistics & downloads:
Abstract page:	160