Mikhail Zakharyaschev
- Mikhail Zakharyaschev has been at HSE since 2015.
Education and Degrees
- 1998
Doctor of Sciences*
- 1978
Degree
Lomonosov Moscow State University
* Doctor of Sciences
A post-doctoral degree called Doctor of Sciences is given to reflect second advanced research qualifications or higher doctorates in ISCED 2011.
A post-doctoral degree called Doctor of Sciences is given to reflect second advanced research qualifications or higher doctorates in ISCED 2011.
Student Term / Thesis Papers
- Bachelor
V. Bodishtyanu «Logic of Existentialism». Faculty of Computer Science, 2017
A. Yagolkovskiy «Extracting RDF-Triples from Text». Faculty of Computer Science, 2017
O. Gerasimova «Ontology Based Data Access with Expressive Ontology Languages». Faculty of Computer Science, 2016
- Master
A. Kirillov «Automated Verification of Facts Using a Knowledge Base». Faculty of Computer Science, 2019
O. Gerasimova «Data Complexity of Answering Ontology-Mediated Queries with a Covering Axiom». Faculty of Computer Science, 2018
Courses (2019/2020)
- Research Seminar "Data Analysis and Artificial Intelligence" (Bachelor’s programme; Faculty of Computer Science; 3 year, 1-4 module)Rus
- Research Seminar ''Intelligent Systems and Structural Analysis'' (Master’s programme; Faculty of Computer Science; 1 year, 1-4 module)Eng
- Semantic Technologies (Bachelor’s programme; Faculty of Computer Science; 4 year, 3 module)Eng
- Past Courses
Courses (2018/2019)
- Combinatorics, Graphs and Computational Logic (Bachelor’s programme; Faculty of Computer Science; 3 year, 3, 4 module)Eng
- Research Seminar "Data Analysis and Artificial Intelligence" (Bachelor’s programme; Faculty of Computer Science; 3 year, 1-4 module)Eng
- Research Seminar ''Intelligent Systems and Structural Analysis'' (Master’s programme; Faculty of Computer Science; 1 year, 1-4 module)Eng
- Semantic Technologies (Bachelor’s programme; Faculty of Computer Science; 4 year, 3 module)Eng
Courses (2017/2018)
- Combinatorics, Graphs and Computational Logic (Bachelor’s programme; Faculty of Computer Science; 3 year, 3, 4 module)Eng
- Research Seminar "Data Analysis and Artificial Intelligence" (Bachelor’s programme; Faculty of Computer Science; 3 year, 1-4 module)Eng
- Scientific Seminar ''Intelligent Systems and Structural Analysis'' (Master’s programme; Faculty of Computer Science; 1 year, 1-4 module)Eng
- Semantic Technologies (Bachelor’s programme; Faculty of Computer Science; 4 year, 3 module)Eng
Courses (2016/2017)
- Combinatorics, Graphs and Computational Logic (Bachelor’s programme; Faculty of Computer Science; 3 year, 3, 4 module)Eng
- Research seminar "Data mining and analysis" (Bachelor’s programme; Faculty of Computer Science; 3 year, 1-4 module)Rus
- Scientific Seminar ''Intelligent Systems and Structural Analysis'' (Master’s programme; Faculty of Computer Science; 1 year, 3, 4 module)Eng
Courses (2015/2016)
Combinatorics, Graphs and Boolean Logic (Bachelor’s programme; Faculty of Computer Science; "Алгоритмика"; field of study "01.03.02. Прикладная математика и информатика"; 3 year, 3, 4 module)Eng
- Introduction to the Semantic Web Technologies (Bachelor’s programme; Faculty of Computer Science; 4 year, 2, 3 module)Eng
Research Seminar «Theoretical Informatics, Computational Logic and Artificial Intelligence» (Bachelor’s programme; Faculty of Computer Science; "Алгоритмика"; field of study "01.03.02. Прикладная математика и информатика"; 3 year, 1-4 module)Rus
- Research Seminar «Theoretical Informatics, Computational Logic and Artificial Intelligence» (Bachelor’s programme; Faculty of Computer Science; 2 year, 1-4 module)Rus
- Research Seminar «Theoretical Informatics, Computational Logic and Artificial Intelligence» (Bachelor’s programme; Faculty of Computer Science; 4 year, 1-3 module)Rus
- Scientific Seminar ''Intelligent Systems and Structural Analysis'' (Master’s programme; Faculty of Computer Science; spec. "Интеллектуальные системы и структурный анализ "; 2 year, 1-4 module)Rus
- Scientific Seminar ''Intelligent Systems and Structural Analysis'' (Master’s programme; Faculty of Computer Science; 1 year, 2-4 module)Rus
Courses (2014/2015)
Knowledge Representation Models and Expert Systems (Bachelor’s programme; Faculty of Computer Science; 4 year, 2, 3 module)Rus
Editorial board membership
2011: Guest Editor, Artificial Intelligence.
2011: Member of the Editorial Council, Journal of Applied Logic.
2011: Guest Editor, Studia Logica.
Conferences
- 201524th International Joint Conference on Artificial Intelligence, IJCAI 2015 (Buenos Aires). Presentation: When Are Description Logic Knowledge Bases Indistinguishable?
- 24th International Joint Conference on Artificial Intelligence, IJCAI 2015 (Buenos Aires). Presentation: First-Order Rewritability of Temporal Ontology-Mediated Queries.
- 28th International Workshop on Description Logics (Athens). Presentation: Conservative Rewritability of Description Logic TBoxes: First Results.
- 28th International Workshop on Description Logics (Athens). Presentation: Interval Temporal Description Logics.
- 29th AAAI Conference on Artificial Intelligence (Austin, Texas). Presentation: Tractable Interval Temporal Propositional and Description Logics.
- 201413th International Semantic Web Conference, ISWC 2014 (Riva del Garda). Presentation: Answering SPARQL Queries over Databases under OWL 2 QL Entailment Regime.
- Reasoning on the Web in the Big Data Era - 10th International Summer School 2014 (Athens). Presentation: An Introduction to Description Logics and Query Rewriting.
- 14th International Conference on Principles of Knowledge Representation and Reasoning, KR 2014 (Vienna). Presentation: Query Inseparability for Description Logic Knowledge Bases.
- 27th International Workshop on Description Logics (Vienna). Presentation: Query Inseparability by Games.
- 27th International Workshop on Description Logics (Vienna). Presentation: Temporal OBDA with LTL and DL-Lite.
- Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), CSL-LICS '14 (Vienna). Presentation: On the succinctness of query rewriting over shallow ontologies.
- 201312th International Semantic Web Conference, ISWC 2013 (Sydney). Presentation: Ontology-Based Data Access: Ontop of Databases.
- 9th International Summer School 2013 (Mannheim). Presentation: Ontology-Based Data Access with Databases: A Short Course.
- 10th International Workshop on OWL: Experiences and Directions (OWLED 2013) co-located with 10th Extended Semantic Web Conference (ESWC 2013) (Montpellier). Presentation: Ontop at Work.
- 2nd International Workshop on OWL Reasoner Evaluation (ORE-2013) (Ulm). Presentation: OBDA with Ontop.
- Logic for Programming, Artificial Intelligence, and Reasoning - 19th International Conference, LPAR-19 (Stellenbosch). Presentation: The Complexity of Clausal Fragments of LTL.
- 23rd International Joint Conference on Artificial Intelligence (Beijing). Presentation: Temporal Description Logic for Ontology-Based Data Access.
- 26th International Workshop on Description Logics (Ulm). Presentation: Query Rewriting and Optimisation with Database Dependencies in Ontop.
- 26th International Workshop on Description Logics (Ulm). Presentation: Conjunctive Query Inseparability in OWL 2 QL is ExpTime-hard.
- 26th International Workshop on Description Logics (Ulm). Presentation: Query Answering via Modal Definability with FaCT++: First Blood.
- 26th International Workshop on Description Logics (Ulm). Presentation: Query Rewriting over Shallow Ontologies.
- 26th International Workshop on Description Logics (Ulm). Presentation: Temporalising OWL 2 QL.
- 201213th International Conference on Principles of Knowledge Representation and Reasoning, KR 2012 (Rome). Presentation: Conjunctive Query Answering with OWL 2 QL.
- Automata, Languages, and Programming - 39th International Colloquium, ICALP 2012 (Warwick). Presentation: Exponential Lower Bounds and Separation for Query Rewriting.
- 2012 International Workshop on Description Logics, DL-2012 (Rome). Presentation: Long Rewritings, Short Rewritings.
- 201122nd International Joint Conference on Artificial Intelligence (IJCAI 2011) (Барселона). Presentation: On the Decidability of Connectedness Constraints in 2D and 3D Euclidean Spaces
Publications26
- Article Zakharyaschev M. et al. Ontology–based access to temporal data with ontop: a framework proposal // International Journal of Applied Mathematics and Computer Science. 2019. Vol. 29. No. 1. P. 17-30. doi
- Article Bienvenu M., Kikot S., Kontchakov R., Podolskii V. V., Zakharyaschev M. Ontology-Mediated Queries: Combined Complexity and Succinctness of Rewritings via Circuit Complexity // Journal of the ACM. 2018. Vol. 65. No. 5. P. 28:1-28:51. doi
- Chapter Gerasimova O., Kikot S., Zakharyaschev M. Towards a Data Complexity Classification of Ontology-Mediated Queries with Covering, in: Proceedings of the 31th International Workshop on Description Logics, Tempe, Arizona, October 27-29, 2018.. Aachen : CEUR Workshop Proceedings, 2018. P. 1-13.
- Chapter Zakharyaschev M., BRESOLIN D., KURUCZ A., MUÑOZ-VELASCO E., RYZHIKOV V., SCIAVICCO G. Horn fragments of the Halpern-Shoham interval temporal logic, in: ACM Transactions on Computational Logic (TOCL) Vol. 18. Issue 3. NY : ACM, 2017. P. 1-39. doi
- Chapter Zakharyaschev M., Botoeva E., Konev B. Y., Lutz C., Ryzhikov V., Wolter F. Inseparability and conservative extensions of description logic ontologies: A survey, in: 12th International Summer School on Reasoning Web Summer School, RW 2016 Issue 9885. , 2017. P. 27-89. doi
- Chapter Gerasimova O., Kikot S., Podolskii V. V., Zakharyaschev M. More on the Data Complexity of Answering Ontology-Mediated Queries with a Covering Axiom, in: Proceedings of the 8th international Conference on Knowledge Engineering and Semantic Web. Berlin : Springer, 2017. doi P. 143-158. doi
- Chapter Gerasimova O., Podolskii V. V., Kikot S., Zakharyaschev M. On the Data Complexity of Ontology-Mediated Queries with a Covering Axiom, in: Proceedings of the 30th International Workshop on Description Logics, Montpellier, France, July 18-21, 2017.. Aachen : CEUR Workshop Proceedings, 2017. Ch. 19. P. 1-12.
- Chapter Zakharyaschev M., Kikot S., Bienvenu M., Kontchakov R., Ryzhikov V. On the parameterised complexity of tree-shaped ontology-mediated queries in OWL2QL, in: Proceedings of the 30th International Workshop on Description Logics, Montpellier, France, July 18-21, 2017.. Aachen : CEUR Workshop Proceedings, 2017.
- Chapter Bienvenu M., Kikot S., Kontchakov R., Ryzhikov V., Zakharyaschev M. Optimal nonrecursive datalog rewritings of linear TGDs and bounded (Hyper)Tree-width queries, in: Proceedings of the 30th International Workshop on Description Logics, Montpellier, France, July 18-21, 2017.. Aachen : CEUR Workshop Proceedings, 2017. P. 1-12.
- Chapter Podolskii V. V., Zakharyaschev M., Bienvenu M., Kikot S., Ryzhikov V., Kontchakov R. The complexity of ontology-based data access with OWL2QL and bounded treewidth queries, in: Proceedings of the ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems Part F127745. ACM, 2017. P. 201-216. doi
- Chapter Konev B. Y., Lutz C., Wolter F., Zakharyaschev M. Conservative rewritability of description logic TBoxes, in: 25th International Joint Conference on Artificial Intelligence. , 2016. P. 1153-1159.
- Chapter Zakharyaschev M., Kontchakov R. Games for query inseparability of description logic knowledge bases, in: Artificial Intelligence Part 234. , 2016. P. 78-119. doi
- Chapter Bienvenu M., Kikot S., Kontchakov R., Podolskii V. V., Zakharyaschev M. Theoretically optimal datalog rewritings for OWL 2 QL ontology-mediated queries, in: International Workshop on Description Logics, DL 2016 Issue 1577. , 2016. P. 1-13.
- Chapter Zakharyaschev M., Artale A., Kontchakov R., Ryzhikov V. Tractable interval temporal propositional and description logics, in: Proceedings of the National Conference on Artificial Intelligence. American Association for Artificial Intelligence (AAAI) Press, 2015. P. 1417-1423.
- Chapter Botoeva E., Zakharyaschev M., Kontchakov R., Ryzhikov V., Wolter F. When are description logic knowledge bases indistinguishable?, in: Proceedings of the Twenty-Fourth International Joint Conference on Artificial Intelligence, IJCAI 2015, Buenos Aires, Argentina, July 25-31, 2015. Palo Alto : AAAI Press, 2015. P. 4240-4246.
- Article Artale A., Kontchakov R., Ryzhikov V., Zakharyaschev M. A Cookbook for Temporal Conceptual Data Modelling with Description Logics // ACM Transactions on Computational Logic. 2014. Vol. 15. No. 3. P. 25.1-25.50.
- Chapter Kontchakov R., Rezk M., Rodríguez-Muro M., Xiao G., Zakharyaschev M. Answering SPARQL Queries over Databases under OWL 2 QL Entailment Regime, in: The Semantic Web – ISWC 2014. Proceedings of 13th International Semantic Web Conference, Part I. Cham : Springer, 2014. Ch. 35. P. 552-567.
- Chapter Kikot S., Kontchakov R., Podolskii V. V., Zakharyaschev M. On the succinctness of query rewriting over shallow ontologies, in: Proceedings of the Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM / IEEE Symposium on Logic in Computer Science (LICS). NY : ACM, 2014. Ch. 57. P. 57.1-57.10.
- Chapter Botoeva E., Kontchakov R., Ryzhikov V., Wolter F., Zakharyaschev M. Query Inseparability for Description Logic Knowledge Bases, in: Proceedings, Fourteenth International Conference on Principles of Knowledge Representation and Reasoning (KR-14). Palo Alto : AAAI Press, 2014. Ch. 25. P. 25.1-25.10.
- Article Kontchakov R., Pratt-Hartmann I., Zakharyaschev M. Spatial reasoning with RCC8 and connectedness constraints in Euclidean spaces // Artificial Intelligence. 2014. Vol. 217. P. 43-75.
- Article Gottlob G., Kikot S., Kontchakov R., Podolskii V. V., Schwentick T., Zakharyaschev M. The price of query rewriting in ontology-based data access // Artificial Intelligence. 2014. Vol. 213. P. 42-59.
- Article Mosurovic M., Krdzavac N., Graves H., Zakharyaschev M. A Decidable Extension of SROIQ with Complex Role Chains and Unions // Journal of Artificial Intelligence Research. 2013. Vol. 47. P. 809-851.
- Chapter Rodríguez-Muro M., Kontchakov R., Zakharyaschev M. Ontology-Based Data Access: Ontop of Databases, in: The Semantic Web – ISWC 2013. Proceedings of12th International Semantic Web Conference, Part I. Cham : Springer, 2013. Ch. 35. P. 558-573.
- Chapter Kikot S., Tsarkov D., Zakharyaschev M., Zolin E. Query Answering via Modal Definability with FaCT++: First Blood, in: Proceedings of the 26th International Workshop on Description Logics (DL 2013) Vol. 1014. CEUR Workshop Proceedings, 2013. P. 328-340.
- Chapter Artale A., Kontchakov R., Wolter F., Zakharyaschev M. Temporal Description Logic for Ontology-Based Data Access, in: Proceedings of the 23rd International Joint Conference on Artificial Intelligence. Beijing : AAAI Press, 2013. Ch. 112. P. 711-718.
- Article Kontchakov R., Pratt-Hartmann I., Nenov Y., Zakharyaschev M. Topological Logics with Connectedness over Euclidean Spaces // ACM Transactions on Computational Logic. 2013. Vol. 14. No. 2. P. 13.1-13.48.
HSE and University of London: Joint BA Programme in Applied Data Analysis
In 2018, the Higher School of Economics will launch an English-taught double degree programme in partnership with the University of London in Applied Data Analysis. Graduates will be awarded an undergraduate degree from HSE in Applied Mathematics and Information Science and a Bachelor of Science in Data Science and Business Analytics from the University of London. International applicants are invited to apply online starting November 15, 2017.
10th International Computer Science Symposium in Russia
On July 13th-17th 2015, the 10th International Computer Science Symposium in Russia took place. The largest conference on theoretical informatics in Russia was organized by Irkutsk State University, the Higher School of Economics and Yandex. Vladimir Podolskii, Associate Professor at the Big Data and Information Retrieval School took part in the event as guest speaker. Maxim Babenko, Head of the Joint Department with Yandex also delivered a report during the event.
