Кикоть Станислав Павлович

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

1. A tetrachotomy of ontology-mediated queries with a covering axiom
   
   Artif. Intell., 309 (2022),  103738–46
2. Ontology-mediated queries: Combined complexity and succinctness of rewritings via circuit complexity
   
   Journal of the ACM, 65:5 (2018), 028, 51 стр.
3. More on the Data Complexity of Answering Ontology-Mediated Queries with a Covering Axiom
   
   Commun. Comput. Inf. Sci., 786 (2017),  143–158
4. On the data complexity of ontology-mediated queries with a covering axiom
   
   CEUR Workshop Proceedings, 1879 (2017),  39–12
5. Theoretically optimal datalog rewritings for OWL 2 QL ontology-mediated queries
   
   CEUR Workshop Proceedings, 1577 (2016),  
6. Tree-like Queries in OWL 2 QL: Succinctness and Complexity Results
   
   LICS, 2015,  317–328
7. The price of query rewriting in ontology-based data access
   
   Artif. Intell., 213 (2014),  42–59
8. Filtration safe operations on frames
   
   Advances in Modal Logic, 12 (2014),  333–352
9. Succinctness of Query Rewriting in OWL 2 QL: The Case of Tree-like Queries
   
   CEUR Workshop Proceedings, 1193 (2014),  45–57
10. Query Rewriting over Shallow Ontologies
    
    CEUR Workshop Proceedings, 1014 (2013),  316–327
11. Exponential lower bounds and separation for query rewriting
    
    Lecture Notes in Comput. Sci., 7392 (2012),  263–274
12. Об аксиоматике квадратов модальных логик с выделенной диагональю
    
    Матем. заметки, 88:2 (2010),  261–274