# The pebbling comonad in Finite Model Theory

@article{Abramsky2017ThePC,
title={The pebbling comonad in Finite Model Theory},
author={S. Abramsky and A. Dawar and Pengming Wang},
journal={2017 32nd Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)},
year={2017},
pages={1-12}
}
• Published 2017
• Computer Science, Mathematics
• 2017 32nd Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)
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 k-pebble games have a natural comonadic formulation. Winning strategies for Duplicator in the k-pebble game for structures A and B are equivalent to morphisms from A to B in the coKleisli category for this comonad… Expand
Relating Structure and Power: Comonadic Semantics for Computational Resources
• Computer Science
• CSL
• 2018
The results pave the way for systematic connections between two major branches of the field of logic in computer science which hitherto have been almost disjoint: categorical semantics, and finite and algorithmic model theory. Expand
Relating Structure and Power: Comonadic Semantics for Computational Resources - Extended Abstract
• Computer Science
• CMCS
• 2018
The results pave the way for systematic connections between two major branches of the field of logic in computer science which hitherto have been almost disjoint: categorical semantics, and finite and algorithmic model theory. Expand
Lovász-Type Theorems and Game Comonads
• Computer Science, Mathematics
• 2021 36th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)
• 2021
This work proposes a new categorical formulation, which applies to any locally finite category with pushouts and a proper factorisation system, and presents a novel application to homomorphism counts in modal logic. Expand
Comonadic semantics for guarded fragments
• Computer Science, Mathematics
• 2021 36th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)
• 2021
A systematic account of how a range of model comparison games which play a central role in finite model theory can be captured in terms of resource-indexed comonads on the category of relational structures, including Ehrenfeucht-Fraïssé, pebbling, and bisimulation games, is extended to quantifier-guarded fragments of first-order logic. Expand
Arboreal Categories and Resources
• Computer Science
• ICALP
• 2021
We introduce arboreal categories, which have an intrinsic process structure, allowing dynamic notions such as bisimulation and back-and-forth games, and resource notions such as number of rounds of aExpand
A Duality Theoretic View on Limits of Finite Structures
• Computer Science, Mathematics
• FoSSaCS
• 2020
It is shown that a closely related but finer grained space of measures arises — via Stone-Priestley duality and the notion of types from model theory — by enriching the expressive power of first-order logic with certain “probabilistic operators”. Expand
The Quantum Monad on Relational Structures
• Computer Science, Physics
• MFCS
• 2017
It is shown how quantum strategies for homomorphism games between relational structures can be viewed as Kleisli morphisms for a quantum monad on the (classical) category of relational structures and homomorphisms. Expand
A Pebbling Comonad for Finite Rank and Variable Logic, and an Application to the Equirank-variable Homomorphism Preservation Theorem
• T. Paine
• Computer Science, Mathematics
• MFPS
• 2020
Abstract In this paper we recast the proof of Rossman's equirank homomorphism preservation theorem using comonadic formulations of bounded quantifier rank and variable count (and dually tree widthExpand
Logical aspects of probability and quantum computation
• Computer Science
• 2019
This thesis proves that the Kleisli category of the quantum monad on relational structures is an effectus, and describes a sufficient condition for a pair of graphs to be cospectral using the quantummonad. Expand
Descriptive complexity of constraint problems
A dichotomy on the number of levels in the Lasserre hierarchy necessary to obtain an exact solution is proved, which proves that a dichotomy exists also in the general case of CSPs, and several results on the definability of VCSPs are obtained. Expand

#### References

SHOWING 1-10 OF 47 REFERENCES
Applications of Categories in Computer Science: Computational comonads and intensional semantics
• Computer Science
• 1992
Abstract We explore some foundational issues in the development of a theory of intensional semantics, in which program denotations may convey information about computation strategy in addition to theExpand
Logical Hierarchies in PTIME
• L. Hella
• Computer Science, Mathematics
• Inf. Comput.
• 1996
It is proved that, for each natural numbern, there is a polynomial time computable query which is not definable in any extension of fixpoint logic by any set of generalized quantifiers, which rules out the possibility of characterizing PTIME in terms of definability in fix point logic extended by a finite set of universal quantifiers. Expand
The sheaf-theoretic structure of non-locality and contextuality
• Physics, Computer Science
• 2011
It is shown that contextuality, and non-locality as a special case, correspond exactly to obstructions to the existence of global sections, and a linear algebraic approach to computing these obstructions is described, which allows a systematic treatment of arguments for non- Locality and contextuality. Expand
Constraint Satisfaction, Bounded Treewidth, and Finite-Variable Logics
• Mathematics, Computer Science
• CP
• 2002
This work shows that constraint satisfaction problems on inputs of treewidth less than k are definable using Datalog programs with at most k variables; this provides a new explanation for the tractability of these classes of problems. Expand
Affine Systems of Equations and Counting Infinitary Logic
• Computer Science, Mathematics
• ICALP
• 2007
It is shown that testing the solvability of systems of equations over a finite Abelian group, a tractable CSP that was previously known not to be definable in Datalog, is not Definable in an infinitary logic with counting and hence that it is not definite in least fixed point logic or its extension with counting. Expand
A Game-Theoretic Approach to Constraint Satisfaction
• Computer Science
• AAAI/IAAI
• 2000
Ex existential -pebble games are used to introduce the concept of -locality and show that it constitutes a new tractable case of constraint satisfaction that properly extends the well known case in which establishing strong -consistency implies global consistency. Expand
On preservation under homomorphisms and unions of conjunctive queries
• Mathematics, Computer Science
• PODS '04
• 2004
The homomorphism-preservation theorem holds for several large classes of finite structures of interest in graph theory and database theory, and it is shown that this result holds for all classes of infinite structures of bounded degree, allclasses of finite structure of bounded treewidth, and, more generally, all classesof finite structures whose cores exclude at least one minor. Expand
One Eilenberg Theorem to Rule Them All
• Mathematics, Computer Science
• ArXiv
• 2016
A generic variety theorem that covers e.g. Wilke's and Pin's work on $\infty$-languages, the variety theorem for cost functions of Daviaud, Kuperberg, and Pin, and unifies the two previous categorical approaches of Boja\'nczyk and of Ad\'amek et al. Expand
Notions of Computation and Monads
• E. Moggi
• Computer Science, Mathematics
• Inf. Comput.
• 1991
Calculi are introduced, based on a categorical semantics for computations, that provide a correct basis for proving equivalence of programs for a wide range of notions of computation. Expand
The Computational Structure of Monotone Monadic SNP and Constraint Satisfaction: A Study through Datalog and Group Theory
• Mathematics, Computer Science
• SIAM J. Comput.
• 1998
This paper isolates a class (of problems specified by) "monotone monadic SNP without inequality" which may exhibit a dichotomy, and explains the placing of all these restrictions by showing, essentially using Ladner's theorem, that classes obtained by using only two of the above three restrictions do not show this dichotomy. Expand