Zakharyaschev Michael

Statistics Math-Net.Ru
Total publications: 2
Scientific articles: 2
Presentations: 5

Number of views:
This page:253
Abstract pages:337
Full texts:91
Zakharyaschev Michael

Doctor of physico-mathematical sciences
Keywords: Logic, complexity, data bases, knowledge representation and reasoning, semantic web.
UDC: 510.6, 517.11


Logic, complexity, data bases, knowledge representation and reasoning, semantic web.

Main publications:
  1. Roman Kontchakov and Frank Wolter and Michael Zakharyaschev, “Logic-based ontology comparison and module extraction, with an application to DL-Lite”, Artif. Intell., 174:15 (2010), 1093–1141  crossref
  2. Frank Wolter and Michael Zakharyaschev, “Undecidability of the unification and admissibility problems for modal and description logics”, ACM Trans. Comput. Log., 9:4 (2008)  crossref
  3. Gabbay, D M and Kurucz, A and Wolter, F and Zakharyaschev, M, Many-dimensional modal logics: theory and applications, Studies in Logic and the Foundations of Mathematics, North-Holland, Amsterdam, 2003
  4. Ian M. Hodkinson and Frank Wolter and Michael Zakharyaschev, “Decidable fragment of first-order temporal logics”, Ann. Pure Appl. Logic, 106:1-3 (2000), 85–134  crossref
  5. Alexander Chagrov, Michael Zakharyaschev, Modal Logic, Oxford Logic Guides, 35, Clarendon Press, Oxford, 1997
List of publications on Google Scholar
List of publications on ZentralBlatt
Full list of publications:

Publications in Math-Net.Ru
1. Ontology-mediated queries: Combined complexity and succinctness of rewritings via circuit complexity
Meghyn Bienvenu, Stanislav Kikot, Roman Kontchakov, Vladimir V. Podolskii, Michael Zakharyaschev
Journal of the ACM, 65:5 (2018), 028
2. More on the Data Complexity of Answering Ontology-Mediated Queries with a Covering Axiom
O. A. Gerasimova, S. P. Kikot, V. V. Podolskii, M. Zakharyaschev
Commun. Comput. Inf. Sci., 786 (2017),  143–158
3. On the data complexity of ontology-mediated queries with a covering axiom
O. Gerasimova, S. Kikot, V. Podolskii, M. Zakharyaschev
CEUR Workshop Proceedings, 1879 (2017),  39–12
4. Theoretically optimal datalog rewritings for OWL 2 QL ontology-mediated queries
M. Bienvenu, S. Kikot, R. Kontchakov, V. Podolskii, M. Zakharyaschev
CEUR Workshop Proceedings, 1577 (2016),  0
5. The price of query rewriting in ontology-based data access
G. Gottlob, S. Kikot, R. Kontchakov, V. Podolskii, T. Schwentick, M. Zakharyaschev
Artif. Intell., 213 (2014),  42–59
6. Query Rewriting over Shallow Ontologies
S. Kikot, R. Kontchakov, V. Podolskii, M. Zakharyaschev
CEUR Workshop Proceedings, 1014 (2013),  316–327
7. Exponential lower bounds and separation for query rewriting
S. Kikot, R. Kontchakov, V. V. Podolskii, M. Zakharyaschev
Lecture Notes in Comput. Sci., 7392 (2012),  263–274
8. Modal companions of superintuitionistic logics: syntax, semantics, and preservation theorems
M. V. Zakharyaschev
Mat. Sb., 180:10 (1989),  1415–1427
9. Disjunctive property of superintuitionist and modal logics
M. V. Zakharyaschev
Mat. Zametki, 42:5 (1987),  729–738

Presentations in Math-Net.Ru
1. Kripke completeness of strictly positive modal logics over meet-semilattices with operators
M. Zakharyaschev
Workshop on Proof Theory, Modal Logic and Reflection Principles
October 18, 2017 15:00   
2. Об аксиоматизации строго позитивных фрагментов модальных логик
M. Zakharyaschev, S. P. Kikot'
Seminar of the Department of Mathematical Logic "Proof Theory"
December 26, 2016 18:30
3. Семантические технологии: новая жизнь для математической логики
M. Zakharyaschev, S. P. Kikot'
Colloquium of the Faculty of Computer Science
December 22, 2016 18:10
4. On ontology-based data access
Michael Zakharyaschev
International workshop "Logical Models of Reasoning and Computation"
February 2, 2012 15:30   
5. Islands of tractability for relational constraints: towards dichotomy results for the description logic $\mathcal{EL}$
Agi Kurucz, Frank Wolter, Michael Zakharyaschev
The eighth International сonference "Advances in Modal Logic" (AiML 2010)
August 24, 2010 10:50   

Contact us:
 Terms of Use  Registration  Logotypes © Steklov Mathematical Institute RAS, 2018