Zobrazeno 1 - 10
of 191
pro vyhledávání: '"Konev, Boris"'
Autor:
Fortin, Marie, Konev, Boris, Ryzhikov, Vladislav, Savateev, Yury, Wolter, Frank, Zakharyaschev, Michael
In reverse engineering of database queries, we aim to construct a query from a given set of answers and non-answers; it can then be used to explore the data further or as an explanation of the answers and non-answers. We investigate this query-by-exa
Externí odkaz:
http://arxiv.org/abs/2305.01248
Data encryption limits the power and efficiency of queries. Direct processing of encrypted data should ideally be possible to avoid the need for data decryption, processing, and re-encryption. It is vital to keep the data searchable and sortable. Tha
Externí odkaz:
http://arxiv.org/abs/2209.15103
Autor:
Fortin, Marie, Konev, Boris, Ryzhikov, Vladislav, Savateev, Yury, Wolter, Frank, Zakharyaschev, Michael
We aim to determine which temporal instance queries can be uniquely characterised by a (polynomial-size) set of positive and negative temporal data examples. We start by considering queries formulated in fragments of propositional linear temporal log
Externí odkaz:
http://arxiv.org/abs/2205.01651
We show that the vast majority of extensions of the description logic $\mathcal{EL}$ do not enjoy the Craig interpolation nor the projective Beth definability property. This is the case, for example, for $\mathcal{EL}$ with nominals, $\mathcal{EL}$ w
Externí odkaz:
http://arxiv.org/abs/2202.07186
Autor:
Botoeva, Elena, Konev, Boris, Lutz, Carsten, Ryzhikov, Vladislav, Wolter, Frank, Zakharyaschev, Michael
The question whether an ontology can safely be replaced by another, possibly simpler, one is fundamental for many ontology engineering and maintenance tasks. It underpins, for example, ontology versioning, ontology modularization, forgetting, and kno
Externí odkaz:
http://arxiv.org/abs/1804.07805
We study the problem of learning description logic (DL) ontologies in Angluin et al.'s framework of exact learning via queries. We admit membership queries ("is a given subsumption entailed by the target ontology?") and equivalence queries ("is a giv
Externí odkaz:
http://arxiv.org/abs/1709.07314
Publikováno v:
New Scientist. 3/15/2014, Vol. 221 Issue 2960, p33-33. 1/9p.
Autor:
Konev, Boris, Lisitsa, Alexei
In 1930s Paul Erdos conjectured that for any positive integer $C$ in any infinite $\pm 1$ sequence $(x_n)$ there exists a subsequence $x_d, x_{2d}, x_{3d},\dots, x_{kd}$, for some positive integers $k$ and $d$, such that $\mid \sum_{i=1}^k x_{i\cdot
Externí odkaz:
http://arxiv.org/abs/1405.3097