Up a level |
Konev, B ORCID: 0000-0002-6507-0494, Lutz, C, Wolter, F and Zakharyaschev, M
(2016)
Conservative Rewritability of Description Logic TBoxes.
In: Twenty-Fifth International Joint Conference on Artificial Intelligence, IJCAI 2016, 2016-7-9 - 2016-7-15, New York.
Konev, B ORCID: 0000-0002-6507-0494, Lutz, C, Wolter, F and Zakharyaschev, M
(2015)
Conservative rewritability of description logic TBoxes: First results.
In: 28th International Workshop on Description Logics, 2015-6-7 - 2015-6-10, Athens.
Botoeva, E, Kontchakov, R, Ryzhikov, V, Wolter, F and Zakharyaschev, M
(2016)
Games for query inseparability of description logic knowledge bases.
Artificial Intelligence, 234.
pp. 78-119.
Jung, JC, Papacchini, F ORCID: 0000-0002-0310-7378, Wolter, F ORCID: 0000-0002-4470-606X and Zakharyaschev, M
(2019)
Model comparison games for horn description logics.
In: 2019 34th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), 2019-6-24 - 2019-6-27, Vancouver.
Jung, JC, Papacchini, F, Wolter, F and Zakharyaschev, M
(2019)
Model comparison games for horn description logics.
.
Artale, A, Kontchakov, R, Kovtunova, A, Ryzhikov, V, Wolter, F ORCID: 0000-0002-4470-606X and Zakharyaschev, M
(2017)
Ontology-mediated query answering over temporal data: A survey.
.
Botoeva, E, Kontchakov, R, Ryzhikov, V, Wolter, F and Zakharyaschev, M
(2014)
Query Inseparability for Description Logic Knowledge Bases.
.
Fortin, M, Konev, B ORCID: 0000-0002-6507-0494, Ryzhikov, V, Savateev, Y, Wolter, F and Zakharyaschev, M
(2022)
Reverse Engineering of Temporal Queries with and without LTL Ontologies: First Steps.
.