BIROn - Birkbeck Institutional Research Online

    Browse by Person

    Up a level
    Export as [feed] Atom [feed] RSS
    Group by: Item Type | Date | Journal or Publication Title | No Grouping
    Number of items: 27.

    ACM Transactions on Computational Logic

    Artale, A. and Kontchakov, Roman and Ryzhikov, Vladislav and Zakharyaschev, Michael (2014) A cookbook for temporal conceptual data modelling with description logic. ACM Transactions on Computational Logic 15 (3), ISSN 1529-3785.

    Kontchakov, Roman and Nenov, Y. and Pratt-Hartmann, I. and Zakharyaschev, Michael (2013) Topological logics with connectedness over Euclidean spaces. ACM Transactions on Computational Logic 14 (2), p. 13. ISSN 1529-3785.

    Artificial Intelligence

    Artale, A. and Kontchakov, Roman and Kovtunova, A. and Ryzhikov, Vladislav and Wolter, F. and Zakhariyashchev, Michael (2021) First-order rewritability of ontology-mediated queries in linear temporal logic. Artificial Intelligence 299 , ISSN 0004-3702.

    Botoeva, E. and Kontchakov, Roman and Ryzhikov, Vladislav and Wolter, F. and Zakharyaschev, Michael (2016) Games for query inseparability of description logic knowledge bases. Artificial Intelligence 234 , pp. 78-119. ISSN 0004-3702.

    Kontchakov, Roman and Pratt-Hartmann, I. and Zakharyaschev, Michael (2014) Spatial reasoning with RCC8 and connectedness constraints in Euclidean spaces. Artificial Intelligence 217 , pp. 43-75. ISSN 0004-3702.

    Gottlob, G. and Kikot, Stanislav and Kontchakov, Roman and Podolskii, V. and Schwentick, T. and Zakharyaschev, Michael (2014) The price of query rewriting in ontology-based data access. Artificial Intelligence 213 , pp. 42-59. ISSN 0004-3702.

    Kontchakov, Roman and Wolter, F. and Zakharyaschev, Michael (2010) Logic-based ontology comparison and module extraction, with an application to DL-Lite. Artificial Intelligence 174 (15), pp. 1093-1141. ISSN 0004-3702.

    CEUR Workshop Proceedings

    Gerasimova, O. and Kikot, S. and Podolskii, V. and Zakharyaschev, Michael (2017) On the data complexity of ontology-mediated queries with a covering axiom. In: Artale, A. and Glimm, B. and Kontchakov, Roman (eds.) DL 2017: International Workshop on Description Logics. CEUR Workshop Proceedings 1879 1879. CEUR Workshop Proceedings.

    Bienvenu, M. and Kikot, S. and Kontchakov, Roman and Ryzhikov, Vladislav and Zakharyaschev, Michael (2017) On the parameterised complexity of tree-shaped ontology-mediated queries in OWL2QL. In: Artale, A. and Glimm, B. and Kontchakov, Roman (eds.) DL 2017: International Workshop on Description Logics. CEUR Workshop Proceedings 1879. CEUR.

    Bienvenu, M. and Kikot, S. and Kontchakov, Roman and Ryzhikov, Vladislav and Zakharyaschev, Michael (2017) Optimal nonrecursive datalog rewritings of linear TGDs and bounded (Hyper)Tree-width queries. In: Artale, A. and Glimm, B. and Kontchakov, Roman (eds.) DL 2017: International Workshop on Description Logics. CEUR Workshop Proceedings 1879 1879. CEUR.

    Kikot, Stanislav and Kontchakov, Roman and Podolskii, V. and Zakharyaschev, Michael (2012) Long rewritings, short rewritings. In: UNSPECIFIED (ed.) Proceedings of the 2012 International Workshop on Description Logics, DL-2012, Rome, Italy, June 7-10, 2012. CEUR Workshop Proceedings 846. CEUR Workshop Proceedings.

    Artale, A. and Ibáñez-García, Y. and Kontchakov, Roman and Ryzhikov, Vladislav (2011) DL-Lite with attributes and sub-roles (extended abstract). In: UNSPECIFIED (ed.) Proceedings of the DL Home 2011 International Workshop on Description Logics (DL2011) - Barcelona, Spain, July 13-16, 2011. CEUR Workshop Proceedings 745. CEUR Workshop Proceedings.

    Konev, B. and Kontchakov, Roman and Ludwig, M. and Schneider, T. and Wolter, F. and Zakharyaschev, Michael (2011) Module extraction via query inseparability in OWL 2 QL. In: UNSPECIFIED (ed.) Proceedings of the 24th International Workshop of Description Logics (DL 2011), Barcelona, Spain, July 13-16, 2011. CEUR Workshop Proceedings 745. CEUR Workshop Proceedings.

    Journal of Artificial Intelligence Research

    Artale, A. and Kontchakov, Roman and Kovtunova, A. and Ryzhikov, Vladislav and Wolter, F. and Zakhariyashchev, Michael (2022) First-Order Rewritability and complexity of Two-Dimensional Temporal Ontology-Mediated Queries. Journal of Artificial Intelligence Research 75 , pp. 1223-1291. ISSN 1076-9757.

    Artale, A. and Kontchakov, Roman and Kovtunova, A. and Ryzhikov, Vladislav and Wolter, F. and Zakharyashchev, Michael (2022) First-order rewritability and complexity of two-dimensional temporal ontology-mediated queries. Journal of Artificial Intelligence Research 75 , pp. 1223-1291. ISSN 1076-9757.

    Artale, A. and Calvanese, D. and Kontchakov, Roman and Zakharyaschev, Michael (2009) The DL-Lite family and relations. Journal of Artificial Intelligence Research 36 (1), pp. 1-69. ISSN 1076-9757.

    Gabelaia, D. and Kontchakov, Roman and Kurucz, A. and Wolter, F. and Zakharyaschev, Michael (2005) Combining spatial and temporal logics: expressiveness vs. complexity. Journal of Artificial Intelligence Research 23 , pp. 167-243. ISSN 1076-9757.

    Journal of the ACM

    Bienvenu, M. and Kikot, Stanislav and Kontchakov, Roman and Podolskii, V. and Zakharyaschev, Michael (2018) Ontology-mediated queries: combined complexity and succinctness of rewritings via circuit complexity. Journal of the ACM 65 (5), ISSN 0004-5411.

    Lecture Notes in Computer Science

    Kikot, Stanislav and Kontchakov, Roman and Podolskii, V. and Zakharyaschev, Michael (2012) Exponential lower bounds and separation for query rewriting. In: Czumaj, A. and Mehlhorn, K. and Pitts, A. and Wattenhofer, R. (eds.) Automata, Languages, and Programming. Lecture Notes in Computer Science 7392 7392. Berlin, Germany: Springer, pp. 263-274. ISBN 9783642315848.

    Kikot, Stanislav and Kontchakov, Roman and Zakharyaschev, Michael (2011) Polynomial conjunctive query rewriting under unary inclusion dependencies. In: Rudolph, S. and Gutierrez, C. (eds.) Web Reasoning and Rule Systems (5th International Conference, RR 2011). Lecture Notes in Computer Science 6902. Berlin, Germany: Springer, pp. 124-138. ISBN 9783642235795.

    Artale, A. and Kontchakov, Roman and Ryzhikov, Vladislav and Zakharyaschev, Michael (2011) Tailoring temporal description logics for reasoning over temporal conceptual models. In: Tinelli, C. and Sofronie-Stokkermans, V. (eds.) Frontiers of Combining Systems. Lecture Notes in Computer Science 6989. Berlin, Germany: Springer, pp. 1-11. ISBN 9783642243639.

    Logical Methods in Computer Science

    Kontchakov, Roman and Pratt-Hartmann, I. and Wolter, F. and Zakharyaschev, Michael (2010) Spatial logics with connectedness predicates. Logical Methods in Computer Science 6 (3), pp. 1-43. ISSN 1860-5974.

    Semantic Web – Interoperability, Usability, Applicability

    Calvanese, D. and Cogrel, B. and Komla-Ebri, S. and Kontchakov, Roman and Lanti, D. and Rezk, M. and Rodriguez-Muro, M. and Xiao, G. (2016) Ontop: answering SPARQL queries over relational databases. Semantic Web – Interoperability, Usability, Applicability 8 (3), pp. 471-487. ISSN 1570-0844.

    Studia Logica

    Konev, B. and Kontchakov, Roman and Wolter, F. and Zakharyaschev, M. (2006) On dynamic topological and metric logics. Studia Logica 84 (1), pp. 129-160. ISSN 0039-3215.

    Kontchakov, Roman and Lutz, C. and Wolter, F. and Zakharyaschev, Michael (2004) Temporalising tableaux. Studia Logica 76 (1), pp. 91-134. ISSN 0039-3215.

    The Bulletin of Symbolic Logic

    Kontchakov, Roman and Kurucz, A. and Zakharyaschev, M. (2005) Undecidability of first-order intuitionistic and modal logics with two variables. The Bulletin of Symbolic Logic 11 (5), p. 428. ISSN 1079-8986.

    Web Semantics: Science, Services and Agents on the World Wide Web

    Gutiérrez-Basulto, V. and Ibáñez-García, Y. and Kontchakov, Roman and Kostylev, E.V. (2015) Queries with negation and inequalities over lightweight ontologies. Web Semantics: Science, Services and Agents on the World Wide Web 35 (4), pp. 184-202. ISSN 1570-8268.

    This list was generated on Tue Nov 26 05:57:04 2024 GMT.