The pebbling comonad in finite model theory
Pebble games are a powerful tool in the study of finite model theory, constraint satisfaction and database theory. Monads and comonads are basic notions of category theory which are widely used in semantics of computation and in modern functional programming. We show that existential kpebble games h...
Главные авторы: | Abramsky, S, Dawar, A, Wang, P |
---|---|
Формат: | Conference item |
Опубликовано: |
IEEE
2017
|
Схожие документы
-
The Pebble-Relation Comonad in Finite Model Theory
по: Yoàv Montacute, и др.
Опубликовано: (2024-05-01) -
Game Comonads & Generalised Quantifiers
по: Adam Ó Conghaile, и др.
Опубликовано: (2024-07-01) -
Lovasz-type theorems and game comonads
по: Dawar, A, и др.
Опубликовано: (2021) -
Relating structure to power: comonadic semantics for computational resources
по: Abramsky, S, и др.
Опубликовано: (2018) -
A comonadic view of simulation and quantum resources
по: Abramsky, S, и др.
Опубликовано: (2019)