Zobrazeno 1 - 4
of 4
pro vyhledávání: '"Kappelmann, Kevin"'
Autor:
Kappelmann, Kevin
Multiple types can represent the same concept. For example, lists and trees can both represent sets. Unfortunately, this easily leads to incomplete libraries: some set-operations may only be available on lists, others only on trees. Similarly, subtyp
Externí odkaz:
http://arxiv.org/abs/2303.05244
Publikováno v:
Proceedings of the VLDB Endowment, Volume 15, Issue 11, July 2022, pp 3045-3057
Guarded tuple-generating dependencies (GTGDs) are a natural extension of description logics and referential constraints. It has long been known that queries over GTGDs can be answered by a variant of the chase - a quintessential technique for reasoni
Externí odkaz:
http://arxiv.org/abs/2212.08522
Publikováno v:
EPTCS 363, 2022, pp. 93-113
Worldwide, computer science departments have experienced a dramatic increase in the number of student enrolments. Moreover, the ongoing COVID-19 pandemic requires institutions to radically replace the traditional way of on-site teaching, moving inter
Externí odkaz:
http://arxiv.org/abs/2207.12703
Autor:
Kappelmann, Kevin
An important class of decidable first-order logic fragments are those satisfying a guardedness condition, such as the guarded fragment (GF). Usually, decidability for these logics is closely linked to the tree-like model property - the fact that sati
Externí odkaz:
http://arxiv.org/abs/1911.03679