Almost never up to date list of publications by Boris Konev

• B. Konev, R. Kontchakov, M. Ludwig, T. Schneider, F. Wolter, and M. Zakharyaschev. Conjunctive query inseparability of OWL 2 QL TBoxes. In Proceedings of the Twenty-Fifth AAAI conference on Artificial Intelligence, 2011.
• B. Konev, C. Lutz, D. Ponomaryov, and F. Wolter. Decomposing description logic ontologies. In Principles of Knowledge Representation and Reasoning: Proceedings of the Twelfth International Conference, KR 2010, Toronto, Ontario, Canada, May 9-13, 2010. AAAI Press, 2010.
• C. Dixon, M. Fisher, and B. Konev. Taming the complexity of temporal epistemic reasoning. In Frontiers of Combining Systems, 7th International Symposium, FroCoS 2009, volume 5749 of Lecture Notes in Computer Science, pages 198–213. Springer, 2009.
• M. Fisher, B. Konev, and A. Lisitsa. Temporal verification of fault-tolerant protocols. In Methods, Models and Tools for Fault Tolerance, volume 5454 of Lecture Notes in Computer Science, pages 44–56. Springer, 2009.
• B. Konev, C. Lutz, D. Walther, and F. Wolter. Formal properties of modularisation. In Modular Ontologies, volume 5445 of Lecture Notes in Computer Science, pages 25–66. Springer, 2009.
• B. Konev, D. Walther, and F. Wolter. Forgetting and uniform interpolation in extensions of the description logic EL. In Description Logics Workshop, volume 477 of CEUR Workshop Proceedings. CEUR-WS.org, 2009.
• B. Konev, D. Walther, and F. Wolter. Forgetting and uniform interpolation in large-scale description logic terminologies. In IJCAI 2009, Proceedings of the 21st International Joint Conference on Artificial Intelligence, pages 830–835, 2009.
• C. Dixon, M. Fisher, B. Konev, and A Lisitsa. Practical first-order temporal reasoning. In 15th International Symposium on Temporal Representation and Reasoning, TIME 2008, pages 156–163. IEEE Computer Society, 2008.
• B. Konev, C. Lutz, D. Walther, and F Wolter. Logical difference and module extraction with cex and mex. In Description Logics Workshop, volume 353 of CEUR Workshop Proceedings. CEUR-WS.org, 2008.
• B. Konev, C. Lutz, D. Walther, and F. Wolter. Semantic modularity and module extraction in description logics. In ECAI 2008 - 18th European Conference on Artificial Intelligence, volume 178 of Frontiers in Artificial Intelligence and Applications, pages 55–59. IOS Press, 2008.
• B. Konev, R. A. Schmidt, and S. Schulz, editors. Proceedings of the First International Workshop on Practical Aspects of Automated Reasoning, volume 373 of CEUR Workshop Proceedings. CEUR-WS.org, 2008.
• B. Konev, D. Walther, and F. Wolter. The logical difference problem for description logic terminologies. In Automated Reasoning, 4th International Joint Conference, volume 5195 of Lecture Notes in Computer Science, pages 259–274. Springer, 2008.
• Proceedings of the LPAR 2008 Workshops, Knowledge Exchange: Automated Provers and Proof Assistants, and the 7th International Workshop on the Implementation of Logics, volume 418 of CEUR Workshop Proceedings. CEUR-WS.org, 2008.
• C. Dixon, M. Fisher, and B. Konev. Temporal logic with capacity constraints. In Proceedings of 6th International Symposium on Frontiers of Combining Systems (FroCoS 2007), pages 163–177, 2007.
• C. Dixon, M. Fisher, and B Konev. Tractable temporal reasoning. In Proceedings 20 International Joint Conference on Artificial Intelligence, pages 318–323, 2007.
• B. Konev and F. Wolter, editors. Proceedings of 6th International Symposium on Frontiers of Combining Systems (FroCoS 2007), volume 4720 of LNAI, 2007. (doi:10.1007/978-3-540-74621-8)
• A. Degtyarev, M. Fisher, and B. Konev. Monodic temporal resolution. ACM Transactions on Computational Logic, 7(1), 2006.
• C. Dixon, M. Fisher, and B. Konev. Is there a future for deductive temporal verification?. In Proceedings of International Symposium on Temporal Representation and Reasoning (TIME), pages 11–18. IEEE CS Press, 2006.
• M. Fisher, W. van der Hoek, B. Konev, and A. Lisitsa, editors. Logics in Artificial Intelligence, 10th European Conference, JELIA 2006, LNAI, 2006. (doi:10.1007/11853886)
• B. Konev, R. Kontchakov, F. Wolter, and M. Zakharyaschev. Dynamic topological logics over spaces with continuous functions. In Proceedings of Advances in Modal Logic 2006 (AiML), 2006.
• A. Lyaletski and B. Konev. On Herbrand's theorem for intuitionistic logic. In Proceedings of the 10th European Conference on Logics in Artificial Intelligence (JELIA'06), LNAI, 2006.
• U. Hustadt, B Konev, and R. A. Schmidt. Deciding monodic fragments by temporal resolution. In Proceedings of the 20th International Conference on Automated Deduction CADE-20 (Tallinn, Estonia, July 22-27, 2005), volume 3632 of LNAI, pages 204–218, 2005.
• B. Konev, A. Degtyarev, C. Dixon, M. Fisher, and U. Hustadt. Mechanising first-order temporal resolution. Information and Computation, 199(1–2):55–86, 2005.
• B. Konev, F. Wolter, and M. Zakharyaschev. Temporal logics over transitive states. In Proceedings of the 20th International Conference on Automated Deduction CADE-20 (Tallinn, Estonia, July 22-27, 2005), volume 3632 of LNAI, pages 182–203, 2005.
• U. Hustadt and B. Konev. TRP++: A temporal resolution prover. In Collegium Logicum, volume 8. KGS Wien, 2004.
• U. Hustadt, B. Konev, A. Riazanov, and A. Voronkov. TeMP: A temporal monodic prover. In Proceedings Internatinoal Joint Conference on Automated Reasoning, volume 3097 of LNAI, pages 326–330. Springer, 2004.
• B. Konev, R. Kontchakov, F Wolter, and M. Zakharyaschev. On dynamic topological and metric logics. In Proceedings of AiML 04, 2004.
• A. Degtyarev, M. Fisher, and B. Konev. Handling equality in monodic temporal resolution. In Proceedings of 10th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning (LPAR), volume 2850 of Lecture Notes in Computer Science, pages 214–228, Almaty, Kazakhstan, 2003. Springer-Verlag.
• A. Degtyarev, M. Fisher, and B. Konev. Monodic temporal resolution. In Proceedings of the 19th International Conference on Automated Deduction, CADE-19, volume 2741 of LNAI, pages 397–411. Springer, 2003.
• U. Hustadt and B. Konev. TRP++ 2.0: A temporal resolution prover. In Proceedings of the 19th International Conference on Automated Deduction, CADE-19, volume 2741 of LNAI, pages 274–278. Springer, 2003.
• B. Konev, A. Degtyarev, C. Dixon, M. Fisher, and U. Hustadt. Towards the implementation of first-order temporal resolution: the expanding domain case. In Proceedings TIME-ICTL'03, pages 72–82. IEEE Computer Society Press, 2003.
• A. Degtyarev, M. Fisher, and B. Konev. A simplified clausal resolution procedure for propositional linear-time temporal logic. In Tableaux 2002, Proceedings, volume 2381 of Lecture Notes in Computer Science, pages 85–99. Springer, 2002.
• U. Hustadt and B. Konev. TRP++: A temporal resolution prover. In Proceedings of 3d International Workshop on the Implementation of Logics, 2002.
• B. Konev and T. Jebelean. Solution lifting method for handling meta-variables in the theorema system. Zapiski Nauchnykh Seminarov POMI, 293:94–117, 2002. English translation: Journal of Mathematical Sciences, Plenum/Kluwer, to appear.
• E. Dantsin, E. A. Hirsch, M. Gavrilovich, and B. Konev. MAXSAT approximation beyond the limits of polynomial-time approximation. Annals of Pure and Applied Logic, 113(1–3):81–94, 2001.
• B. Konev. Upper bound on the height of terms in proofs with bound-depth-restricted cuts. Zapiski Nauchnykh Seminarov POMI, 277:80–103, 2001. English translation: Journal of Mathematical Sciences, Plenum/Kluwer, to appear.
• B. Konev and T. Jebelean. Solution lifting method for handling meta-variables in theorema. Annals of the University of Timisoara, XXXIX:81–106, 2001.
• B. Konev. Refinement of bounds of the height of terms in the most general unifier. Journal of Mathematical Sciences, 98:4, 2000.
• B. Konev and T. Jebelean. Using meta-variables for natural deduction in theorema. In Calculemus 2000: integration of symbolic computation and mechanized reasoning, A. K. Peters, Natik, Massatchussets, 2000.
• B. Konev. Upper bound on the height of terms in proofs with cuts. Technical Report 17/1998, Steklov Institute of Mathematics at St.Petersburg, August 1998.
• B. Konev. Upper bound on the height of terms in proofs with cuts. In Proceedings of First-order Theorem Proving—FTP'98 / 2nd International Workshop on First-order Theorem Proving, Vienna, Austria, pages 162–172, 1998.