Bienvenu Meghyn

Публикации в базе данных Math-Net.Ru

1. Ontology-mediated queries: Combined complexity and succinctness of rewritings via circuit complexity
   
   Journal of the ACM, 65:5 (2018), 028, 51 стр.
2. Theoretically optimal datalog rewritings for OWL 2 QL ontology-mediated queries
   
   CEUR Workshop Proceedings, 1577 (2016),  
3. Tree-like Queries in OWL 2 QL: Succinctness and Complexity Results
   
   LICS, 2015,  317–328
4. Succinctness of Query Rewriting in OWL 2 QL: The Case of Tree-like Queries
   
   CEUR Workshop Proceedings, 1193 (2014),  45–57