Zakharyaschev Michael

Publications in 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 pp.
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),  0
6. The price of query rewriting in ontology-based data access
   
   Artif. Intell., 213 (2014),  42–59
7. Query Rewriting over Shallow Ontologies
   
   CEUR Workshop Proceedings, 1014 (2013),  316–327
8. Exponential lower bounds and separation for query rewriting
   
   Lecture Notes in Comput. Sci., 7392 (2012),  263–274
9. On the relation between intuitionistic and classical modal logics
   
   Algebra Logika, 36:2 (1997),  121–155
10. Syntax and semantics of superintuitionistic logics
    
    Algebra Logika, 28:4 (1989),  402–429
11. Modal companions of superintuitionistic logics: syntax, semantics, and preservation theorems
    
    Mat. Sb., 180:10 (1989),  1415–1427
12. Syntax and semantics of modal logics that contain ${\rm S}4$
    
    Algebra Logika, 27:6 (1988),  659–689
13. Disjunctive property of superintuitionist and modal logics
    
    Mat. Zametki, 42:5 (1987),  729–738
14. Normal modal logics containing $\mathrm{S}4$
    
    Dokl. Akad. Nauk SSSR, 275:3 (1984),  537–540
15. On intermediate logics
    
    Dokl. Akad. Nauk SSSR, 269:1 (1983),  18–22