Research papers and books

      2024

  1. Jean Christoph Jung, Vladislav Ryzhikov, Frank Wolter and Michael Zakharyaschev. Extremal Separation Problems for Temporal Instance Queries. Full paper on arXiv. IJCAI 2024.
  2. Jean Christoph Jung, Vladislav Ryzhikov, Frank Wolter and Michael Zakharyaschev. Unique Characterisability and Learnability of Temporal Queries Mediated by an Ontology. Full paper. Submitted.
  3. Frank Wolter and Michael Zakharyaschev. Interpolant Existence is Undecidable for Two-Variable First-Order Logic with Two Equivalence Relations. Paper on arXiv. Submitted.
  4. Louwe Kuijer, Tony Tan, Frank Wolter and Michael Zakharyaschev. Separating Counting from Non-Counting in Fragments of Two-Variable First-Order Logic (Extended Abstract). Paper. Submitted.
  5. Agi Kurucz, Frank Wolter and Michael Zakharyaschev. The Interpolant Existence Problem for Weak K4 and Difference Logic. Paper on arXiv. Submitted.

    6.   2023

  6. M. Fortin, B. Konev, V. Ryzhikov, Y. Savateev, F. Wolter and M. Zakharyaschev. Reverse Engineering of Temporal Queries Mediated by LTL Ontologies. IJCAI 2023: 3230-3238. Full paper
  7. J.Ch. Jung, V. Ryzhikov, F. Wolter and M. Zakharyaschev. Temporalising Unique Characterisability and Learnability of Ontology-Mediated Queries. DL 2023. Paper
  8. A. Kurucz, F. Wolter and M. Zakharyaschev. Definitions and (Uniform) Interpolants in First-Order Modal Logics. KR 2023: 417-428. Full paper
  9. A. Kurucz, V. Ryzhikov, Y. Savateev, and M. Zakharyaschev. Deciding FO-rewritability of Regular Languages and Ontology-mediated Queries in Linear Temporal Logic. J. Artif. Intell. Res. 76: 645-703, 2023. Paper
  10. A. Kurucz, F. Wolter and M. Zakharyaschev. A non-uniform view of Craig interpolation in modal logics with linear frames. Submitted. Paper

    11.   2022

  11. O. Gerasimova, S. Kikot, A. Kurucz, V. Podolskii, M. Zakharyaschev. A Tetrachotomy of Ontology-Mediated Queries with a Covering Axiom. Artificial Intelligence. Vol. 39, 2022. Open access paper Arxiv paper
  12. A. Artale, R. Kontchakov, A. Kovtunova, V. Ryzhikov F. Wolter and M. Zakharyaschev. First-Order Rewritability and Complexity of Two-Dimensional Temporal Ontology-Mediated Queries. JAIR, 2022. Open access paper
  13. M. Fortin, B. Konev, V. Ryzhikov, Y. Savateev, F. Wolter, M. Zakharyaschev. Unique Characterisability and Learnability of Temporal Instance Queries. KR 2022. Arxiv full paper
  14. M. Fortin, B. Konev, V. Ryzhikov, Y. Savateev, F. Wolter, M. Zakharyaschev. Reverse Engineering of Temporal Queries with and without LTL Ontologies: First Steps.DL 2022. Paper
  15. A. Artale, R. Kontchakov, A. Kovtunova, V. Ryzhikov, F. Wolter, M. Zakharyaschev. On the First-Order Rewritability of Ontology-Mediated Queries in Linear Temporal Logic (Extended Abstract). IJCAI 2022. Paper

    16.   2021

  16. A. Artale, R. Kontchakov, A. Kovtunova, V. Ryzhikov F. Wolter and M. Zakharyaschev. First-Order Rewritability of Ontology-Mediated Queries in Linear Temporal Logic. Artificial Intelligence, 2021. Paper
  17. S. Kikot, A. Kurucz, V. Podolskii, M. Zakharyaschev. Deciding Boundedness of Monadic Sirups. PODS 2021: 370-387 Paper
  18. A. Kurucz, V. Ryzhikov, Y. Savateev, M. Zakharyaschev. Deciding FO-definability of Regular Languages. RAMICS 2021. Full paper
  19. V. Ryzhikov, Y. Savateev, M. Zakharyaschev. Deciding FO-rewritability of Ontology-Mediated Queries in Linear Temporal Logic. TIME 2021. Full paper

    20.   2020

  20. O. Gerasimova, S. Kikot, A. Kurucz, V. Podolskii, M. Zakharyaschev. A Data Complexity and Rewritability Tetrachotomy of Ontology-Mediated Queries with a Covering Axiom. KR 2020: 403-413. Paper
  21. R. Kontchakov, V. Ryzhikov, F. Wolter, M. Zakharyaschev. Boolean Role Inclusions in DL-Lite With and Without Time. KR 2020: 582-591. Paper
  22. V. Ryzhikov, P. Walega, M. Zakharyaschev. Temporal Ontology-Mediated Queries and First-Order Rewritability: A Short Course. Reasoning Web 2020: 109-148. Paper

    23.   2019

  23. E. Botoeva, C. Lutz, V. Ryzhikov, F. Wolter and M. Zakharyaschev. Query Inseparability for ALC Ontologies. Artificial Intelligence, 272: 1-51 (2019) Paper
  24. S. Kikot, A. Kurucz, Y. Tanaka, F. Wolter and M. Zakharyaschev. Kripke Completeness of Strictly Positive Modal Logics over Meet-semilattices with Operators. Journal of Symbolic Logic, vol. 84, issue 2, 2019, pp. 533-588. Paper
  25. J.Ch. Jung, F. Papacchini, F. Wolter, M. Zakharyaschev. Model Comparison Games for Horn Description Logics. LICS 2019: 1-14. Paper (full version)
  26. V. Ryzhikov, P.A. Walega, M. Zakharyaschev. Data Complexity and Rewritability of Ontology-Mediated Queries in Metric Temporal Logic under the Event-Based Semantics. IJCAI 2019: 1851-1857. Paper
  27. O. Gerasimova, S. Kikot, M. Zakharyaschev. Checking the Data Complexity of Ontology-Mediated Queries: A Case Study with Non-uniform CSPs and Polyanna. Description Logic, Theory Combination, and All That 2019: 329-351 Paper
  28. E.G.Kalayci, S. Brandt, D. Calvanese, V. Ryzhikov, G. Xiao, M. Zakharyaschev. Ontology-based access to temporal data with Ontop: A framework proposal. Applied Mathematics and Computer Science 29(1): 17-30 (2019). Paper
  29. R. Kontchakov, V. Ryzhikov, F. Wolter, M. Zakharyaschev. A Note on DL-Lite with Boolean Role Inclusions. Description Logics 2019. Paper

    30.   2018

  30. M. Bienvenu, S. Kikot, R. Kontchakov, V. Podolskii and M. Zakharyaschev. Ontology-Mediated Queries: Combined Complexity and Succinctness of Rewritings via Circuit Complexity. Journal of the ACM 65, 5, Article 28 (August 2018). Paper
  31. S. Brandt, E. Guzel Kalayci, V. Ryzhikov, G. Xiao and M. Zakharyaschev. Querying Log Data with Metric Temporal Logic. Journal of Artificial Intelligence Research 62 (2018) 829-877. Paper
  32. G. Xiao, D. Calvanese, R. Kontchakov, D. Lembo, A. Poggi, R. Rosati and M. Zakharyaschev. Ontology-Based Data Access: A Survey. In Proc. of the 27th Int. Joint Conf. on Artificial Intelligence, IJCAI-ECAI 2018 (Stockholm, 13-19 July). Paper
  33. S. Kikot, R. Kontchakov, S. Rapisarda, and M. Zakharyaschev. STYPES: Nonrecursive Datalog Rewriter for Linear TGDs and Conjunctive Queries. ODBASE 2018, the 17th International Conference on Ontologies, DataBases, and Applications of Semantics. Paper
  34. S. Kikot, A. Kurucz, F. Wolter and M. Zakharyaschev. On strictly positive modal logics with S4.3 frames. In Proc. of AiML 2018 (Bern, August 27-31). Paper

    35.   2017

  35. D. Hovland, R. Kontchakov, M. Skjæveland, A. Waaler and M. Zakharyaschev. Ontology-Based Data Access to Slegge. In Proc. of the 16th Int. Semantic Web Conf., ISWC 2017 (Vienna, 21-25 October), Springer, 2017. Complete resource description.
  36. A. Artale, R. Kontchakov, A. Kovtunova, V. Ryzhikov, F. Wolter and M. Zakharyaschev. Ontology-Mediated Query Answering over Temporal Data: A Survey. In Proc. of the 24th Int. Symposium on Temporal Representation and Reasoning, TIME 2017 (Mons, 16-18 October), LIPIcs, 2017. Paper
  37. M. Bienvenu, S. Kikot, R. Kontchakov, V. Ryzhikov and M. Zakharyaschev. On the Parameterised Complexity of Tree-Shaped Ontology-Mediated Queries in OWL 2 QL. In Proc. of the 30th Int. Workshop on Description Logics, DL-2017 (Montpellier, 18-21 July), CEUR-WS, vol. 1879, 2017.
  38. M. Bienvenu, S. Kikot, R. Kontchakov, V. Ryzhikov and M. Zakharyaschev. Optimal Nonrecursive Datalog Rewritings of Linear TGDs and Bounded (Hyper)Tree-Width Queries. In Proc. of the 30th Int. Workshop on Description Logics, DL-2017 (Montpellier, 18-21 July), CEUR-WS, vol. 1879, 2017.
  39. O. Gerasimova, S. Kikot, V. Podolskii and M. Zakharyaschev. On the Data Complexity of Ontology-Mediated Queries with a Covering Axiom. In Proc. of the 30th Int. Workshop on Description Logics, DL-2017 (Montpellier, 18-21 July), CEUR-WS, vol. 1879, 2017.
  40. O. Gerasimova, S. Kikot, V. Podolskii and M. Zakharyaschev. More on the Data Complexity of Ontology-Mediated Queries with a Covering Axiom. In Knowledge Engineering and Semantic Web, Proc. of the 8th International Conference, KESW 2017, Szczecin, Poland, November 8-10, 2017. Communications in Computer and Information Science book series (CCIS, volume 786), Springer. Paper
  41. M. Bienvenu, S. Kikot, R. Kontchakov, V. Podolskii, V. Ryzhikov and M. Zakharyaschev. The Complexity of Ontology-Based Data Access with OWL 2 QL and Bounded Treewidth Queries. In Proc. of the 36th ACM Symposium on Principles of Database Systems, PODS 2017 (Chicago, 14-19 May), 2017. Full version
  42. M. S. Kikot, A. Kurucz, F. Wolter and M. Zakharyaschev. Alt_n in a Strictly Positive Context. Topology, algebra, and categories in Logic (TACL 2017), Prague, June 26?-30 2017. Paper
  43. E. Botoeva, B. Konev, C. Lutz, V. Ryzhikov, F. Wolter and M. Zakharyaschev. Inseparability and Conservative Extensions of Description Logic Ontologies: A Survey. In "Reasoning Web: Logical Foundation of Knowledge Graph Construction and Query Answering", Editors: Jeff Z. Pan, Diego Calvanese, Thomas Eiter, Ian Horrocks, Michael Kifer, Fangzhen Lin, Yuting Zhao. Springer, Lecture Notes in Computer Science Volume 9885, 2017 Paper
  44. S. Brandt, E. Guzel Kalayci, R. Kontchakov, V. Ryzhikov, G. Xiao, and M. Zakharyaschev. Ontology-Based Data Access with a Horn Fragment of Metric Temporal Logic. AAAI 2017: 1070-1076. Paper

    45.   2016

  45. E. Botoeva, C. Lutz, V. Ryzhikov, F. Wolter and M. Zakharyaschev. Query-Based Entailment and Inseparability for ALC Ontologies. IJCAI 2016. Full paper
  46. R. Kontchakov, L. Pandolfo, L. Pulina, V. Ryzhikov and M. Zakharyaschev. Temporal and Spatial OBDA with Many-Dimensional Halpern-Shoham Logic. IJCAI 2016. Paper
  47. B. Konev, C. Lutz, F. Wolter and M. Zakharyaschev. Conservative Rewritability of Description Logic TBoxes. IJCAI 2016. Paper
  48. M. Bienvenu, S. Kikot, R. Kontchakov, V. Podolskii and M. Zakharyaschev. Theoretically Optimal Datalog Rewritings for OWL 2 QL Ontology-Mediated Queries. DL 2016. Full paper
  49. D. Bresolin, A. Kurucz, E. Munoz-Velasco, V. Ryzhikov, G. Sciavicco, and M. Zakharyaschev. Horn Fragments of the Halpern-Shoham Interval Temporal Logic. ACM Trans. Comput. Log. 18(3): 22:1-22:39 (2017). Paper
  50. E. Botoeva, R. Kontchakov, V. Ryzhikov, F. Wolter and M. Zakharyaschev. Games for Query Inseparability of Description Logic Knowledge Bases. Artificial Intelligence, 234:78-119, 2016. Paper

    51.   2015

  51. A. Artale, R. Kontchakov, A. Kovtunova, V. Ryzhikov F. Wolter and M. Zakharyaschev. First-Order Rewritability of Temporal Ontology-Mediated Queries. In Proceedings of IJCAI (Buenos Aires, 25-31 July). AAAI, 2015. Paper
  52. E. Botoeva, R. Kontchakov, V. Ryzhikov, F. Wolter and M. Zakharyaschev. When Are Description Logic Knowledge Bases Indistinguishable? In Proceedings of IJCAI (Buenos Aires, 25-31 July). AAAI, 2015. Paper
  53. B. Konev, C. Lutz, F. Wolter and M. Zakharyaschev. Conservative Rewritability of Description Logic TBoxes: First Results. In Proceedings of the 28th International Workshop on Description Logics, Athens, Greece, June 7-10, 2015. Paper
  54. A. Artale, R. Kontchakov, V. Ryzhikov and M. Zakharyaschev. Tractable Interval Temporal Propositional and Description Logics. In Proceedings of AAAI, 2015, 1417-1423. Paper

    55.   2014

  55. R. Kontchakov, I. Pratt-Hartmann and M. Zakharyaschev. Spatial Reasoning with RCC8 and Connectedness Constraints in Euclidean Spaces. Artificial Intelligence, 217:43-75, 2014. Paper
  56. R. Kontchakov, M. Rezk, M. Rodríguez-Muro, G. Xiao and M. Zakharyaschev. Answering SPARQL Queries over Databases under OWL 2 QL Entailment Regime. In P. Mika, et al., editors, Proceedings of ISWC (Riva del Garda, 19-23 October), Springer, 2014. Paper (corrected).
  57. S. Kikot, R. Kontchakov, V. Podolskii and M. Zakharyaschev. On the Succinctness of Query Rewriting over Shallow Ontologies. In T. Henzinger and D. Miller, editors, Proceedings of CSL-LICS (Vienna, 14-18 July), pp. 57:1-57:10. ACM, 2014. Paper. Full version
  58. A. Artale, R. Kontchakov, V. Ryzhikov and M. Zakharyaschev. A Cookbook for Temporal Conceptual Data Modelling with Description Logics. ACM Transactions on Computational Logic (TOCL), vol. 15(3), 2014. Paper
  59. G. Gottlob, S. Kikot, R. Kontchakov, V. Podolskii, T. Schwentick and M. Zakharyaschev. The Price of Query Rewriting in Ontology-Based Data Access. Artificial Intelligence, 213:42-59, 2014. Paper
  60. E. Botoeva, R. Kontchakov, V. Ryzhikov, F. Wolter and M. Zakharyaschev. Query Inseparability for Description Logic Knowledge Bases. In C. Baral, G. De Giacomo and T. Eiter, editors, Proceedings of KR (Vienna, 20-24 July). AAAI, 2014. (The 2014 Marco Cadoli Student Paper Prize) Full version
  61. R. Kontchakov and M. Zakharyaschev. An Introduction to Description Logics and Query Rewriting. In M. Koubarakis, G. Stamou and G. Stoilos, editors, Reasoning Web Summer School (Athens, 8-13 September), vol. 8714 of LNCS, pp. 195-244. Springer, 2014. Paper
  62. A. Artale, R. Kontchakov, A. Kovtunova, V. Ryzhikov, F. Wolter and M. Zakharyaschev. Temporal OBDA with LTL and DL-Lite. In M. Bienvenu, M. Ortiz, R. Rosati and M. Simkus, editors, Informal Proceedings of DL (Vienna, 17-20 July), pp. 21-32. CEUR Workshop Proceedings, vol. 1193, 2014. Paper
  63. E. Botoeva, R. Kontchakov, V. Ryzhikov, F. Wolter and M. Zakharyaschev. Query Inseparability by Games. In M. Bienvenu, M. Ortiz, R. Rosati and M. Simkus, editors, Informal Proceedings of DL (Vienna, 17-20 July), pp. 83-95. CEUR Workshop Proceedings, vol. 1193, 2014. Paper

    64.   2013

  64. A. Artale, R. Kontchakov, V. Ryzhikov, and M. Zakharyaschev. The Complexity of Clausal Fragments of LTL. In K. McMillan, A. Middeldorp and A. Voronkov, editors, Proceedings of LPAR (Stellenbosch, South Africa, 15-19 December), LNCS vol. 8312, pp. 35-52. Springer, 2013. Paper
  65. M. Rodríguez-Muro, R. Kontchakov and M. Zakharyaschev. Ontology-Based Data Access: Ontop of Databases. In H. Alani, et al., editors, Proceedings of ISWC (Sydney, 21-25 October), vol. 8218 of LNCS, pp. 558-573. Springer, 2013. Paper
  66. R. Kontchakov, Y. Nenov, I. Pratt-Hartmann and M. Zakharyaschev. Topological Logics with Connectedness over Euclidean Spaces. ACM Transactions on Computational Logic (TOCL), 14(2):13, 2013. Paper
  67. M. Mosurovic, N. Krdzavac, H. Graves and M. Zakharyaschev. A Decidable Extension of SROIQ with Complex Role Chains and Unions. Journal of Artificial Intelligence Research (JAIR), 47 (2013) 809-851. Paper
  68. M. Mosurovic and M. Zakharyaschev. On the Complexity of (Restricted) ALCIr. Publications de l'Institut Mathematique, 95:133-147, 2014. Paper
  69. R. Kontchakov, M. Rodriguez-Muro and M. Zakharyaschev. Ontology-Based Data Access with Databases: A Short Course. In S. Rudolph, G. Gottlob, I. Horrocks, F. van Harmelen, editors, Summer School on Reasoning Web (Mannheim, 30 July - 2 August), vol. 8067 of LNCS, pp. 194-229. Springer, 2013. Paper
  70. S. Kikot, R. Kontchakov, V. Podolskii and M. Zakharyaschev. Query Rewriting over Shallow Ontologies. In Proceedings of DL 2013. Paper Full draft version
  71. S. Kikot, D. Tsarkov, M. Zakharyaschev and E. Zolin. Query Answering via Modal Definability with FaCT++: First Blood. In Proceedings of DL 2013. Paper
  72. M. Rodriguez-Muro, R. Kontchakov and M. Zakharyaschev. Query Rewriting and Optimisation with Database Dependencies in Ontop. In Proceedings of DL 2013. Paper
  73. R. Kontchakov, V. Ryzhikov and M. Zakharyaschev. Conjunctive Query Inseparability in OWL 2 QL is ExpTime-hard. In Proceedings of DL 2013. Paper
  74. M. Rodríguez-Muro, R. Kontchakov and M. Zakharyaschev. OBDA with Ontop. In S. Bail, B. Glimm, R. Gonçalves, E. Jiménez-Ruiz, Y. Kazakov, N. Matentzoglu, B. Parsia, Informal Proceedings of ORE (Ulm, 22 July), pp. 101-106. CEUR Workshop Proceedings, vol. 1015, 2013. Paper
  75. M. Rodríguez-Muro, R. Kontchakov and M. Zakharyaschev. Ontop at Work. In M. Rodríguez-Muro, S. Jupp, K Srinivas, Proceedings of OWLED (Montpellier, 26-27 May). CEUR Workshop Proceedings, vol. 1080, 2013. Paper
  76. A. Artale, R. Kontchakov, F. Wolter and M. Zakharyaschev. Temporal Description Logic for Ontology-Based Data Access. In Proceedings of IJCAI (Beijing, 3-9 August), 2013. Full version

    77.   2012

  77. S. Kikot, R. Kontchakov, V. Podolskii and M. Zakharyaschev. Exponential Lower Bounds and Separation for Query Rewriting. In Proceedings of ICALP 2012. Paper. Full paper in arXiv
  78. S. Kikot, R. Kontchakov and M. Zakharyaschev. Conjunctive Query Answering with OWL 2 QL. In Proceedings of KR 2012 (13th International Conference on Principles of Knowledge Representation and Reasoning). Paper
  79. F. Wolter and M. Zakharyaschev. On the Blok-Esakia Theorem. In "Leo Esakia on Duality in Modal and Intuitionistic Logics" (edited by Guram Bezhanishvili). Springer, 2014. Paper
  80. S. Kikot, R. Kontchakov, V. Podolskii and M. Zakharyaschev. Long Rewritings, Short Rewritings. In Proceedings of DL 2012. Paper

    81.   2011

  81. R. Kontchakov, C. Lutz, D. Toman, F. Wolter and M. Zakharyaschev. The Combined Approach to Ontology-Based Data Access. In Proceedings of IJCAI 2011. Paper
  82. R. Kontchakov, Y. Nenov, I. Pratt-Hartmann and M. Zakharyaschev. On the Decidability of Connectedness Constraints in 2D and 3D Euclidean Spaces. In Proceedings of IJCAI 2011. (Distinguished paper award) Paper
  83. A. Kurucz, Y. Tanaka, F. Wolter and M. Zakharyaschev. Conservativity of Boolean Algebras with Operators over Semilattices with Operators. In Proceedings of TACL 2011. Paper
  84. S. Kikot, R. Kontchakov and M. Zakharyaschev. Polynomial Conjunctive Query Rewriting under Unary Inclusion Dependencies. In Proceedings of RR, LNCS, Springer, 2011. (Best paper award) Paper
  85. B. Konev, R. Kontchakov, M. Ludwig, T. Schneider, F. Wolter and M. Zakharyaschev. Conjunctive Query Inseparability of OWL 2 QL TBoxes. In Proceedings of AAAI 2011. Paper
  86. A. Kurucz, F. Wolter and M. Zakharyaschev. On P/NP Dichotomies for EL Subsumption under Relational Constraints. In Proceedings of DL 2011. Paper
  87. B. Konev, R. Kontchakov, M. Ludwig, T. Schneider, F. Wolter and M. Zakharyaschev. Module Extraction via Query Inseparability in OWL 2 QL. In Proceedings of DL 2011. Paper
  88. S. Kikot, R. Kontchakov and M. Zakharyaschev. On (In)Tractability of OBDA with OWL 2 QL. In Proceedings of DL (Barcelona, 13-16 July), pp.  224-234. CEUR Workshop Proceedings, vol. 745, 2011. Paper
  89. A. Artale, R. Kontchakov, V. Ryzhikov, and M. Zakharyaschev. Tailoring Temporal Description Logics for Reasoning over Temporal Conceptual Models. In C. Tinelli, and V. Sofronie-Stokkermans, editors, Proceedings of FroCoS (Saarbrücken, Germany, 5-7 October), LNAI vol. 6989, pp. 1-11. Springer, 2011. Paper

    90.   2010

  90. A. Artale, R. Kontchakov, V. Ryzhikov and M. Zakharyaschev. Complexity of Reasoning over Temporal Data Models. In J. Parsons, M. Saeki, P. Shoval, C. Woo and Y. Wand, editors, Proceedings of ER (Vancouver, British Columbia, 1-4 November), LNCS vol. 6412. Springer, 2010 Paper
  91. A. Artale, R. Kontchakov, V. Ryzhikov and M. Zakharyaschev. Past and Future of DL-Lite. In M. Fox and D. Poole, editors, Proceedings of AAAI (Atlanta, USA, July 11-15), pp. 243-248. AAAI Press, 2010. Paper
  92. R. Kontchakov, C. Lutz, D. Toman, F. Wolter and M. Zakharyaschev. The Combined Approach to Query Answering in DL-Lite. In F. Lin, U. Sattler and M. Truszczynski, editors, Proceeding of KR (Toronto, Canada, May 9-13), AAAI Press, 2010. (2010 Ray Reiter best paper prize) Paper
  93. A. Artale, R. Kontchakov, V. Ryzhikov and M. Zakharyaschev. Temporal Conceptual Modelling with DL-Lite. In Proceedings of DL 2010 (Waterloo, Canada, May 4-7). CEUR Workshop Proceedings, vol. 573, 2010. Paper
  94. R. Kontchakov, I. Pratt-Hartmann and M. Zakharyaschev. Interpreting Topological Logics over Euclidean Spaces. In F. Lin, U. Sattler and M. Truszczynski, editors, Proceeding of KR (Toronto, Canada, May 9-13), AAAI Press, 2010. Paper
  95. A. Kurucz, F. Wolter and M. Zakharyaschev. Islands of tractability for relational constraints: towards dichotomy results for the description logic EL. In L. Beklemishev, V. Goranko and V. Shehtman, editors, Advances in Modal Logic, vol.8, pp.271-291, 2010. Paper
  96. R. Kontchakov, F. Wolter and M. Zakharyaschev. A logic-based framework for ontology comparison and module extraction in DL-Lite. Artificial Intelligence 174(15):1093-1141, October 2010. Paper
  97. R. Kontchakov, I. Pratt-Hartmann, F. Wolter and M. Zakharyaschev. Spatial logics with connectedness predicates. Logical Methods in Computer Science 6(3), 2010. Paper
  98. M. Sheremet, F. Wolter and M. Zakharyaschev. A modal logic framework for reasoning about comparative distances and topology. Annals of Pure and Applied Logic, volume 161, issue 4, January 2010, pages 534-559. Paper

    99.   2009

  99. R. Kontchakov, L. Pulina, U. Sattler, T. Schneider, P. Selmer, F. Wolter and M. Zakharyaschev. Minimal Module Extraction from DL-Lite Ontologies using QBF Solvers. In Proceedings of IJCAI-09 (Pasadena, July 11-17), pp. 836-841, 2009. Paper
  100. A. Artale, D. Calvanese, R. Kontchakov and M. Zakharyaschev. DL-Lite without UNA. In B. Cuenca Grau, I. Horrocks, B. Motik and U. Sattler, editors, Proceedings of DL 2009 (Oxford, July 27-30). CEUR Workshop Proceedings, vol. 477, 2009. Paper
  101. A. Artale, D. Calvanese, R. Kontchakov and M. Zakharyaschev. Adding Weight to DL-Lite. In B. Cuenca Grau, I. Horrocks, B. Motik and U. Sattler, editors, Proceedings of DL 2009 (Oxford, July 27-30). CEUR Workshop Proceedings, vol. 477, 2009. Paper
  102. A. Artale, R. Kontchakov, V. Ryzhikov and M. Zakharyaschev. DL-Lite with Temporalised Concepts, Rigid Axioms and Roles. In Proceedings of FroCoS-09 (Trento, Italy, 16-18 September), LNAI, vol. 5749, Springer, 2009. Paper
  103. R. Kontchakov, C. Lutz, D. Toman, F. Wolter and M. Zakharyaschev. Combined FO Rewritability for Conjunctive Query Answering in DL-Lite. In B. Cuenca Grau, I. Horrocks, B. Motik and U. Sattler, editors, Proceedings of DL 2009 (Oxford, July 27-30). CEUR Workshop Proceedings, vol. 477, 2009. Paper
  104. U. Sattler, T. Schneider and M. Zakharyaschev. Which Kind of Module Should I Extract? In B. Cuenca Grau, I. Horrocks, B. Motik and U. Sattler, editors, Proceedings of DL 2009 (Oxford, July 27-30). CEUR Workshop Proceedings, vol. 477, 2009. Paper
  105. A. Artale, R. Kontchakov, V. Ryzhikov and M. Zakharyaschev. Extending DL-Lite Sometime in the Future. In B. Cuenca Grau, I. Horrocks, B. Motik and U. Sattler, editors, Proceedings of DL 2009 (Oxford, July 27-30). CEUR Workshop Proceedings, vol. 477, 2009. Paper
  106. A. Artale, D. Calvanese, R. Kontchakov and M. Zakharyaschev. The DL-Lite family and relations. Journal of Artificial Intelligence Research (JAIR), 36:1-69, 2009. Paper
  107. R. Kontchakov, I. Pratt-Hartmann and M. Zakharyaschev. Topological logics over Euclidean spaces. In Proceedings of Topology, Algebra and Categories in Logic, TACL 2009 (Amsterdam, July 7-11, 2009). Paper

    108.   2008

  108. R. Kontchakov and M. Zakharyaschev. DL-Lite with role inclusions. In J. Domingue, Ch. Anutariya, editors, The Semantic Web, 3rd Asian Semantic Web Conference, ASWC 2008 (Bangkok, Thailand, December 8-11, 2008), pp. 16-30, LNCS, vol. 5367, Springer 2008. Paper
  109. R. Kontchakov, I. Pratt-Hartmann, F. Wolter and M. Zakharyaschev. On the computational complexity of spatial logics with connectedness constraints. In I. Cervesato, H. Veith and A. Voronkov, editors, Proceedings of LPAR 2008 (Doha, Qatar, November 22-27, 2008), pp. 574-589, LNAI, vol. 5330, Springer 2008. Paper
  110. R. Kontchakov, I. Pratt-Hartmann, F. Wolter and M. Zakharyaschev. Topology, connectedness, and modal logic. In C. Areces and R. Goldblatt, editors, Advances in Modal Logic, vol. 7, pp. 151-176. College Publications, London, 2008. Paper
  111. R. Kontchakov, F. Wolter and M. Zakharyaschev. Can you tell the difference between DL-Lite ontologies? In G. Brewka and J. Lang, Proceedings of KR-2008 (Sydney, Australia, September 16-19, 2008), pp. 285-295. AAAI Press, 2008. (2008 Ray Reiter best paper prize) Paper
  112. C. Lutz, F. Wolter and M. Zakharyaschev. Temporal description logics: a survey. In Proceedings of the Fifteenth International Symposium on Temporal Representation and Reasoning. IEEE Computer Society Press, pp. 3-14. 2008. Paper
  113. R. Kontchakov, V. Ryzhikov, F. Wolter and M. Zakharyaschev. Checking DL-Lite modularity with QBF solvers. In F. Baader, C. Lutz and B. Motik, Proceedings of DL'08 (Dresden, Germany, May 13-16, 2008). CEUR Workshop Proceedings, vol. 353, 2008. Paper
  114. F. Wolter and M. Zakharyaschev. Undecidability of the unification and admissibility problems for modal and description logics. ACM Transactions of Computational Logic (TOCL), vol.9(4), 2008. Paper

    115.   2007

  115. A. Artale, D. Calvanese, R. Kontchakov, V. Ryzhikov and M. Zakharyaschev. Reasoning over Extended ER Models. In C. Parent, K.-D. Schewe and V. C. Storey, editors, ER 2007 Conference Proceedings. Springer, 2007. Paper
  116. A. Artale, D. Calvanese, R. Kontchakov and M. Zakharyaschev. Query Answering in Expressive Variants of DL-Lite. Proceedings of the Fifteenth Italian Symposium on Advanced Database Systems (SEBD 2007, Torre Canne, Fasano, Italy, June 17-20, 2007), pp. 250-257, 2007. Paper
  117. R. Kontchakov, F. Wolter and M. Zakharyaschev. Modularity in DL-Lite. Proceedings of DL'07 (Brixen/Bressanone, Italy, June 8-10, 2007), pp. 76-87, 2007. CEUR Workshop Proceedings, vol. 250. Paper
  118. A. Artale, D. Calvanese, R. Kontchakov, V. Ryzhikov and M. Zakharyaschev. Complexity of Reasoning over Entity-Relationship Models. Proceedings of DL'07 (Brixen/Bressanone, Italy, June 8-10, 2007), pp. 163-170, 2007. CEUR Workshop Proceedings, vol. 250. Paper
  119. A. Artale, R. Kontchakov, C. Lutz, F. Wolter and M. Zakharyaschev. Temporalising tractable description logics. In V. Goranko and X.S. Wang, editors, Proceedings of TIME 2007 (Alicante, Spain, June 28-30, 2007), pp. 11-22. IEEE Computer Society, 2007. Paper
  120. A. Artale, D. Calvanese, R. Kontchakov, and M. Zakharyaschev. DL-Lite in the light of first-order logic. In Proceedings of the 22nd AAAI Conference on Artificial Intelligence (Vancouver, British Columbia, July 22–26, 2007), pp. 361-366. AAAI Press, 2007. Paper
  121. R. Kontchakov, A. Kurucz, F. Wolter and M. Zakharyaschev. Spatial logic + temporal logic = ? A draft of a chapter for "Logic of Space" to be published by Springer (editors: M. Aiello, I. Pratt-Hartmann, J. van Benthem), 2007. Paper
  122. F. Wolter and M. Zakharyaschev. Modal decision problems. Handbook of Modal Logic (editors: P. Blackburn, J. van Benthem, and F. Wolter), Elsevier, pp.427-489, 2007. Paper
  123. M. Sheremet, D. Tishkovsky, F. Wolter and M. Zakharyaschev. A logic for concepts and similarity. Journal of Logic and Computation, 2007, 17:415-452. Paper
  124. D. Gabbay, S. Goncharov and M. Zakharyaschev (Eds.) Mathematical Problems from Applied Logic II. Logics for the XXIst Century. International Mathematical Series, Vol. 5. Springer, 2007. Hardcover ISBN: 978-0-387-69244-9. Springer page

    125.   2006

  125. U. Hustadt, D. Tishkovsky, F. Wolter and M. Zakharyaschev. Automated reasoning about metric and topology. JELIA 2006, LNCS 4160, Springer 2006, pp.490-493. Paper
  126. B. Konev, R. Kontchakov, F. Wolter and M. Zakharyaschev. Dynamic topological logics over spaces with continuous functions. Advances in Modal Logic, vol.6, G. Governatori, I. Hodkinson and Y. Venema (eds.), pp.299-318, College Publications, London, 2006. Paper
  127. S. Ghilardi, C. Lutz, F. Wolter and M. Zakharyaschev. Conservative extensions in modal logic. Advances in Modal Logic, vol.6, G. Governatori, I. Hodkinson and Y. Venema (eds.), pp.187-208, College Publications, London, 2006. Extended abstract Full paper
  128. M. Sheremet, D. Tishkovsky, F. Wolter and M. Zakharyaschev. From topology to metric: modal logic and quantification in metric spaces. Advances in Modal Logic, vol.6, G. Governatori, I. Hodkinson and Y. Venema (eds.), pp.429-448, College Publications, London, 2006. Paper
  129. D. Gabelaia, A. Kurucz, F. Wolter, and M. Zakharyaschev. Non-primitive recursive decidability of products of modal logics with expanding domains. Annals of Pure and Applied Logic, vol.142, pp.245-268, 2006. Paper
  130. W. Rautenberg, F. Wolter and M. Zakharyaschev. Wim Blok and modal logic. Studia Logica, vol.83, pp.15-30, 2006. Paper
  131. B. Konev, R. Kontchakov, F. Wolter and M. Zakharyaschev. On dynamic topological and metric logics. Studia Logica, vol.84, pp.127-158, 2006. Paper
  132. D. Gabbay, S. Goncharov and M. Zakharyaschev (Eds.) Mathematical Problems from Applied Logic I. Logics for the XXIst Century. International Mathematical Series, Vol. 4. Springer, 2006. Hardcover ISBN: 978-0-387-28688-4. Springer page

    133.   2005

  133. A. Kurucz, F. Wolter, and Michael Zakharyaschev. Modal logics for metric spaces: open problems. In We Will Show Them: Essays in Honour of Dov Gabbay, Vol 2. S. Artemov, H. Barringer, A. S. d'Avila Garcez, L. C. Lamb, and J. Woods (eds.), College Publications, pages 193-208, 2005. Paper
  134. M. Sheremet, D. Tishkovsky, F. Wolter and M. Zakharyaschev. Comparative similarity, tree automata, and Diophantine equations. In Proceedings of LPAR 2005, volume 3835 of LNAI, pages 651-665. Springer, 2005. Short version Full paper
  135. B. Konev, F. Wolter and M. Zakharyaschev. Temporal logics over transitive states. LNCS 3632, (R. Nieuwenhuis editor), pp.182-203, Springer, 2005 (Proceedings of CADE-05). Paper
  136. M. Sheremet, D. Tishkovsky, F. Wolter and M. Zakharyaschev. `Closer' representation and reasoning. 2005 International Workshop on Description Logics, (Proceedings of DL 2005). Paper
  137. R. Kontchakov, A. Kurucz, and M. Zakharyaschev. Undecidability of first-order intuitionistic and modal logics with two variables. Bulletin of Symbolic Logic, vol.ll, no.3, pp. 428-438, 2005. Paper
  138. D. Gabelaia, R. Kontchakov, A. Kurucz, F. Wolter, and M. Zakharyaschev. Combining spatial and temporal logics: expressiveness vs. complexity. Journal of Artificial Intelligence Research (JAIR), vol. 23, pp.167-243, 2005. Paper
  139. D. Gabelaia, A. Kurucz, F. Wolter, and M. Zakharyaschev. Products of `transitive' modal logics. Journal of Symbolic Logic, vol.70, no.3, pp.993-1021, 2005. Paper
  140. F. Wolter and M. Zakharyaschev. A logic for metric and topology. Journal of Symbolic Logic, vol.70, no.3, pp.795-828, 2005. Paper

    141.   2004

  141. B. Konev, R. Kontchakov, F. Wolter and M. Zakharyaschev. On dynamic topological and metric logics. Proceedings of AiML 2004, September 2004, Manchester, U.K. Paper (full version)
  142. D. Gabelaia, A. Kurucz and M. Zakharyaschev. Products of transitive modal logics without the (abstract) finite model property. Proceedings of AiML 2004, September 2004, Manchester, U.K. Paper
  143. O. Kutz, C. Lutz, F. Wolter and M. Zakharyaschev. E-connections of abstract description systems. Artificial Intelligence, 156(1), pp.1-73, 2004. Paper
  144. S. Bauer, I. Hodkinson, F. Wolter, and M. Zakharyaschev. On non-local propositional and weak monodic quantified CTL*. Journal of Logic and Computation, vol. 14, no. 1, pp. 3-22, 2004. Paper
  145. R. Kontchakov, C. Lutz, F. Wolter, and M. Zakharyaschev. Temporalising tableaux. Studia Logica, 76(1):91-134, 2004. Paper

    146.   2003

  146. D. Gabelaia and M. Zakharyaschev. Properties of products with GL.3. Manuscript, 2003. Abstract
  147. D.M. Gabbay, A. Kurucz, F. Wolter and M. Zakharyaschev. Many-Dimensional Modal Logics: Theory and Applications. Studies in Logic and the Foundations of Mathematics, 148. Elsevier, North-Holland. 2003.
  148. C. Lutz, F. Wolter and M. Zakharyaschev. Reasoning about concepts and similarity. In Proceedings of 2003 International Workshop on Description Logics (DL2003), Rome, pp.142-151. Paper
  149. P. Balbiani, N.-Y. Suzuki, F. Wolter and M. Zakharyaschev (editors). Advaces in Modal Logic. Vol. 4. King's College Publications, 2003.
  150. O. Kutz, C. Lutz, F. Wolter and M. Zakharyaschev. E-connections of description logics. In Proceedings of 2003 International Workshop on Description Logics (DL2003), Rome, pp.178-187. Paper
  151. C. Lutz, F. Wolter and M. Zakharyaschev. A tableau algorithm for reasoning about concepts and similarity. Automated Reasoning with Analytic Tableaux and Related Methods International Conference, TABLEAUX 2003, Rome, Italy, September 9-12, 2003. Lecture Notes in Computer Science, Vol. 2796 Cialdea Mayer, Marta; Pirri, Fiora (Eds.) Paper (full version)
  152. F. Wolter and M. Zakharyaschev. Reasoning about distances. 18th International Joint Conference on Artificial Intelligence (IJCAI 2003), pp.1275-1280. Paper
  153. I. Hodkinson, R. Kontchakov, A. Kurucz, F. Wolter and M. Zakharyaschev. On the computational complexity of decidable fragments of first-order linear temporal logics. 10th International Symposium on Temporal Representation and Reasoning and Fourth International Conference on Temporal Logic July 08 - 10, 2003 Cairns, Queensland, Australia, TIME-ICTL 2003, IEEE Computer Society, pp.91-98. Paper
  154. D. Gabelaia, R. Kontchakov, A. Kurucz, F. Wolter, and M. Zakharyaschev. On the computational complexity of spatio-temporal logics. Proceedings of the Sixteenth International Florida Artificial Intelligence Research Symposium Conference (FLAIRS 2003), AAAI Press, pp.460-464. Paper
  155. A. Kurucz and M. Zakharyaschev. A note on relativised products of modal logics. Advances in Modal Logic, vol. 4, 2003, pp.221-242. Paper
  156. O. Kutz, H. Sturm, N.-Y. Suzuki, F. Wolter and M. Zakharyaschev. Logics of metric spaces. ACM Transactions in Computational Logic, vol. 4(2), 2003, pp. 260-294. ISSN 1529-3785.   Paper

    157.   2002

  157. S. Bauer, I. Hodkinson, F. Wolter and M. Zakharyaschev. On non-local propositional and one-variable quantified CTL*. Proceedings of TIME 2002, pp.2-9. IEEE Computer Science Press, 2002. Paper
  158. I. Hodkinson, F. Wolter and M. Zakharyaschev. Decidable and undecidable fragments of first-order branching temporal logics. Proceedings of the 17th Annual IEEE Symposium on Logic in Computer Science, LICS 2002, pp.393-402. Paper
  159. A. Artale, E. Franconi, F. Wolter and M. Zakharyaschev. A temporal description logic for reasoning over conceptual schemas and queries. In S. Flesca, S. Greco, N. Leone, and G. Ianni, editors, Proceedings of JELIA'02, volume 2424 of LNCS, pages 98-110, Springer, 2002. Paper
  160. F. Wolter, H. Wansing, M. de Rijke, and M. Zakharyaschev (editors). Advaces in Modal Logic. Vol. 3. World Scientific. 2002.
  161. O. Kutz, F. Wolter and M. Zakharyaschev. Connecting abstract description systems. In Proceedings of the 8th International Conference on Principles of Knowledge Representation and Reasoning (KR'02), pp.215-226. Morgan Kaufmann, 2002.  Paper
  162. O. Kutz, H. Sturm, N.-Y. Suzuki, F. Wolter and M. Zakharyaschev. Axiomatizing distance logics. Journal of Applied Non-Classical Logic, vol.12, pp.425-440, 2002.   Paper
  163. F. Wolter and M. Zakharyaschev. Qualitative spatio-temporal representation and reasoning: a computational perspective. In G. Lakemeyer and B. Nebel, editors "Exploring Artifitial Intelligence in the New Millenium," pages 175-216, Morgan Kaufmann, 2002.   Paper
  164. C. Lutz, H. Sturm, F. Wolter, and M. Zakharyaschev. A tableau decision algorithm for modalized ALC with constant domains. Studia Logica, vol.72, pp.199-232, 2002.  Paper
  165. F. Wolter and M. Zakharyaschev. Axiomatizing the monodic fragment of first-order temporal logic. Annals of Pure and Apllied Logic, vol. 118, pp.133-145, 2002.  Paper
  166. H. Sturm, F. Wolter and M. Zakharyaschev. Common knowledge and quantification. Economic Theory, vol.19, 2002, pp.157-186.  Paper
  167. B. Bennett, A. Cohn, F. Wolter, and M. Zakharyschev. Multi-dimensional modal logic as a framework for spatio-temporal reasoning. Applied Intelligence, vol.17, issue 3, pp.239-251, 2002.   Paper

    168.   2001

  168. I. Hodkinson, F. Wolter and M. Zakharyaschev. Monodic fragments of first-order temporal logics: 2000--2001 A.D. In Logic for Programming, Artificial Intelligence and Reasoning, number 2250 of LNAI, Springer 2001, pp.1-23.  Paper
  169. O. Kutz, F. Wolter, and M. Zakharyaschev. A note on concepts and distances. In Proceedings of the International Workshop on Description Logic (DL 2001), Stanford, D. McGuinness, P. Patel-Schneider, C. Goble, R. Moeller (editors), pp.113-121.   Paper
  170. A. Artale, E. Franconi, M. Mosurovic, F. Wolter, and M. Zakharyaschev. The DLR(US) temporal description logic. In Proceedings of the International Workshop on Description Logic (DL 2001), Stanford, D. McGuinness, P. Patel-Schneider, C. Goble, R. Moeller (editors), pp.96-105.   Paper
  171. M. Zakharyaschev, K. Segerberg, M. de Rijke, and H. Wansing (editors). Advaces in Modal Logic. Vol. 2. CSLI Publications, Stanford. 2001.
  172. C. Lutz, H. Sturm, F. Wolter, and M. Zakharyaschev. Tableaux for temporal description logic with constant domains. In Automated Reasoning, number 2083 of LNAI, Springer, 2001, pp.121-136..  Paper
  173. C. Lutz, H. Sturm, F. Wolter, and M. Zakharyaschev. A tableau calculus for temporal description logic: the constant domain case. LTCS-Report, RWTH, Aachen, 2001.  Paper
  174. F. Wolter, M. Zakharyaschev, and M. Mosurovic. Temporal description logics: a point-based approach. AI*IA Notizie, Anno XIV, no. 1, Marzo 2001, pp.16-20.
  175. M. Reynolds and M. Zakharyaschev. On the products of linear modal logics. Journal of Logic and Computation, vol. 11, 2001, pp.909-931.  Paper
  176. F. Wolter and M. Zakharyaschev. Decidable fragments of first-order modal logics. Journal of Symbolic Logic, vol. 66, pp.1415-1438, 2001.  Paper
  177. M. Zakharyaschev, F. Wolter and A. Chagrov. Advanced Modal Logic. In Handbook of Philosophical Logic, 2nd edition, D.M. Gabbay and F. Guenthner, editors, vol.3, pp.83-266. Kluwer Academic Publishers, 2001.  Chapter

    178.   2000

  178. H. Sturm, N.-Y. Suzuki, F. Wolter and M. Zakharyaschev. Semi-qualitative reasoning about distances: a preliminary report. In Proceedings of JELIA 2000, Lecture Notes in Artificial Intelligence, vol. 1919, pp.37-56, Springer, 2000.  Paper
  179. H. Sturm, F. Wolter and M. Zakharyaschev. Monodic epistemic predicate logic. In Proceedings of JELIA 2000, Lecture Notes in Artificial Intelligence, vol.1919, pp. 329-344, Springer, 2000.  Paper
  180. I. Hodkinson, F. Wolter and M. Zakharyaschev. Decidable fragments of first-order temporal logics. Annals of Pure and Apllied Logic,  106 (2000) 85-134.  Paper
  181. F. Wolter and M. Zakharyaschev. Dynamic description logics. In M. Zakharyaschev,  K. Segerberg,  M. de Rijke, and H. Wansing, editors, Advances in Modal Logic, vol. 2. CSLI Publications, Stanford, 2000.  Paper
  182. M. Zakharyaschev, K. Segerberg, M. de Rijke, and H. Wansing, The roots of modern modal logic. In M. Zakharyaschev, K. Segerberg, M. de Rijke, and H. Wansing editors, Advances in Modal Logic, vol. 2. CSLI Publications, Stanford 2000. (In print)
  183. F. Wolter and M. Zakharyaschev. Spatial reasoning in RCC-8 with Boolean region terms. In Proceedings of ECAI 2000, pages 244-250. IOS Press, 2000.  Paper
  184. F. Wolter and M. Zakharysachev. Spatio-temporal representation and reasoning based on RCC-8. In Proceedings of the Seventh International Conference KR2000, pages 3-14. Morgan Kaufmann, 2000. (2000 Best Paper Award.)   Paper
  185. F. Wolter and M. Zakharyaschev. Temporalizing description logics. In D. Gabbay and M. de Rijke, editors, Frontiers of Combining Systems 2, (FroCoS'98), pages 379-402, Kluwer Academic Publishers, 2000.  Paper

    186.  

  186. F. Wolter and M. Zakharyaschev. Modal description logic: modalizing roles. Fundamenta Informaticae. 39 (1999), pp.411-438.  Paper
  187. M. Mosurovich and M. Zakharyaschev. On the complexity of description logics with modal operators. In Proceedings of the 2nd Panhellenic Logic Symposium, July 13-17, 1999, Delphi, Greece, pp.166-171.  Paper
  188. F. Wolter and M. Zakharyaschev. Multi-dimensional description logics. In Proceedings of the 16th International Joint Conference on Artificial Intelligence, IJCAI'99, Stockholm, Sweden, pages 104-109. Morgan Kaufmann, 1999.  Paper
  189. F. Wolter and M. Zakharyaschev. Intuitionistic modal logics as fragments of classical bimodal logics. In E. Orlowska, editor, Logic at Work, Springer-Verlag, 1999, pp.168-186.  Paper
  190. F. Wolter and M. Zakharyaschev. Intuitionistic modal logic. In A. cantini, E. Casari, and P. Minari, editors, Logic and Foundations of Mathematics. Kluwer Academic Publishers, 1999, pp. 227-238.  Paper
  191. F. Wolter and M. Zakharyaschev. Satisfiability problem in description logics with modal operators. In A.G. Cohn, L. Schubert, S.C. Shapiro, editors, Proceedings of the 6th International Conference on Principles of Knowledge Representation and Reasoning (KR'98), Montreal, Canada, 1998. Morgan Kaufman, pp. 512-523. Paper
  192. Y. Suzuki, F. Wolter and M. Zakharyaschev. Speaking about transitive frames in propositional languages. Journal of Logic, Language and Information, vol.7 (1998), pp.317-339.  Paper
  193. M. Kracht, M. de Rijke, H. Wansing and M. Zakharyaschev (editors). Advances in Modal Logics, Vol.1. CSLI Publications, 1998.
  194. A. Chagrov and M. Zakharyaschev. Mathematical aspects of modal logic: achievements, tendencies, problems. Bulletin of the Section of Logic, vol.27 (1998), pp.50-52.
  195. A. Chagrov and M. Zakharyaschev. Modal Logic. Clarendon Press, Oxford, Oxford Logic Guides 35, 1997. 605 pp.
  196. M. Zakharyaschev. The greatest extension of S4 into which intuitionistic logic is embeddable. Studia Logica, vol.59 (1997), pp. 345-358.
  197. M. Zakharyaschev. Canonical formulas for K4. Part III: the finite model property. Journal of Symbolic Logic, vol.62 (1997), pp. 950-975.
  198. M. Zakharyaschev. Canonical formulas for modal and superintuitionistic logics: a short outline. In M. de Rijke, editor, Advances in Intensional Logic, pp. 191-243, Kluwer Academic Publishers, 1997.
  199. F. Wolter and M. Zakharyaschev. On the relation between intuitionistic and classical modal logics. Algebra and Logic, vol.36 (1997), pp. 73-92. Paper
  200. G. Bezhanishvili and M. Zakharyaschev. Logics over MIPC. In T. Shimura, editor, Sequent Calculus and Kripke Semantics, RIMS, Kyoto University, No. 1021, 1997, pp. 86-95.
  201. M. Zakharyaschev. Canonical formulas for K4. Part II: Cofinal subframe logics. Journal of Symbolic Logic, vol.61 (1996), pp. 421-449.
  202. A. Chagrov and M. Zakharyaschev. On the independent axiomatizability of modal and intermediate logics. Journal of Logic and Computation, vol.5 (1995), pp.2 87-302.
  203. A. Chagrov and M. Zakharyaschev. Sahlqvist formulas are not so elementary even above S4. In Logic Colloquium'92, (L. Csirmaz, D. Gabbay, M. de Rijke, editors), CSLI Publications, Stanford, 1995, pp. 61-73.
  204. M. Zakharyaschev and A. Alekseev. All finitely axiomatizable normal extensions of K4.3 are decidable. Mathematical Logic Quarterly, vol.41 (1995), pp. 15-23.
  205. M. Zakharyaschev. A new solution to a problem of Hosoi and Ono. Notre Dame Journal of Formal Logic, vol.35 (1994), pp. 450-457.
  206. M. Zakharyaschev. A sufficient condition for the finite model property of modal logics above K4. Bulletin of the IGPL, vol.1 (1993), pp. 13-21.
  207. A. Chagrov and M. Zakharyaschev. The undecidability of the disjunction property of propositional logics and other related problems. Journal of Symbolic Logic, vol.58 (1993), pp. 967-1002.
  208. M. Zakharyaschev. Canonical formulas for K4. Part I: Basic results. Journal of Symbolic Logic, vol.57 (1992), pp. 1377-1402.
  209. A. Chagrov and M. Zakharyaschev. Modal companions of intermediate propositional logics. Studia Logica, vol.51 (1992), pp. 49-82.
  210. M. Zakharyaschev. Intermediate logics with disjunction free axioms are canonical. IGPL Newsletter, vol.1 (1992), no.4, pp. 7-8.
  211. A. Chagrov and M. Zakharyaschev. The disjunction property of intermediate propositional logics. Studia Logica, vol.50 (1991), pp. 189-216.
  212. M. Zakharyaschev. Modal companions of intermediate logics: syntax, semantics and preservation theorems. Mathematics of the USSR, Sbornik, vol.68 (1991), pp.277-289.
  213. V. Antimirov, A. Voronkov, A. Degtyariov and M. Zakharyaschev. Mathematical logic in programming. In Mathematical Logic in Programming (M. Zakharyaschev and Yu. Yanov, editors), Mir Publishers, Moscow, 1991, pp.331-407. (Russian)
  214. A. Nabebin and M. Zakharyaschev. Logic Programming based on the Resolution Method in Predicate Logic. Moscow Energy Institute, 1990. (In Russian)
  215. A. Chagrov and M. Zakharyaschev. On Hallden-completeness of intermediate and modal logics. Bulletin of the Section of Logic, vol.19 (1990), pp.21-24.
  216. A. Chagrov and M. Zakharyaschev. An essay in complexity aspects of modal and intermediate calculi. Proceedings of the Fourth Asian Logic Conference, 1990, CSK Educational Center, Tokyo, pp.26-29.
  217. M. Zakharyaschev. Syntax and semantics of intermediate logics. Algebra and Logic, vol.28 (1989), pp.262-282.
  218. M. Zakharyaschev. Syntax and semantics of modal logics containing S4. Algebra and Logic, vol.27 (1988), pp.408-428.
  219. M. Zakharyaschev. On the disjunction property of intermediate and modal logics. Mathematical Notes, vol.42 (1987), pp.901-905.
  220. M. Zakharyaschev. Theorem proving in intermediate and modal logics. Lecture Notes in Computer Science (L. Budach, R.G. Bukharaev and O.B. Lupanov, editors), vol.278 (1987), pp.492-496.
  221. M. Zakharyaschev. Normal modal logics containing S4. Soviet Mathematics Doklady, vol.29 (1984), pp.252-255
  222. M. Zakharyaschev. On intermediate logics. Soviet Mathematics Doklady, vol.27 (1983), pp.274-277.
  223. M. Zakharyaschev. Certain classes of intermediate logics. Institute of Applied Mathematics, Preprint no. 160, Moscow, 1978. (Russian)
  224. M. Zakharyaschev and S. Popov. On the cardinality of countermodels for intuitionistic calculus. Institute of Applied Mathematics, Preprint no. 45, Moscow, 1980. (Russian)
  225. M. Zakharyaschev and S. Popov. On the complexity of Kripke countermodels for intuitionistic propositional calculus. In Proceedings of the Second Soviet--Finland Colloquium on Logic, Institute of Philosophy, 1979, Moscow, pp.32-36. (Russian)
  226. M. Zakharyaschev, M. Korotkova and S. Popov. An interactive system for theorem proving. Semiotics and Informatics, vol.12 (1979), pp.22-23. (In Russian)
  227. M. Zakharyaschev and S. Popov. A procedure for automated theorem proving based on the syntactic tree method. Institute of Applied Mathematics, Preprint no. 111, Moscow, 1978. (Russian)
[ home | comments ]