Pebble Games with Algebraic Rules

@article{Dawar2012PebbleGW,
  title={Pebble Games with Algebraic Rules},
  author={A. Dawar and Bjarki Holm},
  journal={ArXiv},
  year={2012},
  volume={abs/1205.0913}
}
We define a general framework of partition games for formulating two-player pebble games over finite structures. We show that one particular such game, which we call the invertible-map game, yields a family of polynomial-time approximations of graph isomorphism that is strictly stronger than the well-known Weisfeiler-Lehman method. The general framework we introduce includes as special cases the pebble games for finite-variable logics with and without counting. It also includes a matrix… Expand
18 Citations
Approximations of Isomorphism and Logics with Linear-Algebraic Operators
  • 6
  • PDF
Generalizations of k-Weisfeiler-Leman partitions and related graph invariants
  • 1
  • PDF
Descriptive complexity of linear equation systems and applications to propositional proof complexity
  • Martin Grohe, Wied Pakusa
  • Computer Science
  • 2017 32nd Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)
  • 2017
  • 14
  • PDF
Symmetric Circuits for Rank Logic
  • 2
  • PDF
On the relative power of algebraic approximations of graph isomorphism
  • PDF
RANK LOGIC IS DEAD, LONG LIVE RANK LOGIC!
  • 5
  • PDF
Linear equation systems and the search for a logical characterisation of polynomial time
  • 15
On the Expressive Power of Query Languages for Matrices
  • 1
  • PDF
Separating Rank Logic from Polynomial Time
  • Highly Influenced
  • PDF
Graphs Identified by Logics with Counting
  • 23
  • PDF
...
1
2
...

References

SHOWING 1-10 OF 20 REFERENCES
Pebble Games for Rank Logics
  • 3
  • PDF
Logical Hierarchies in PTIME
  • L. Hella
  • Computer Science, Mathematics
  • Inf. Comput.
  • 1996
  • 137
  • Highly Influential
Logics with Rank Operators
  • 52
  • PDF
Finite model theory
  • 896
The structure of graphs and new logics for the characterization of Polynomial Time
  • 31
  • PDF
The Graph Isomorphism Problem and approximate categories
  • H. Derksen
  • Computer Science, Mathematics
  • J. Symb. Comput.
  • 2013
  • 9
  • Highly Influential
  • PDF
Describing Graphs: A First-Order Approach to Graph Canonization
  • 242
  • Highly Influential
  • PDF
An optimal lower bound on the number of variables for graph identification
  • 255
  • Highly Influential
Polynomial time algorithms for modules over finite dimensional algebras
  • 58
The complexity of relational query languages (Extended Abstract)
  • 1,458
...
1
2
...