Graph rewriting: an algebraic and logic approach
Handbook of theoretical computer science (vol. B)
Handbook of combinatorics (vol. 2)
On the Desirability of Acyclic Database Schemes
Journal of the ACM (JACM)
The complexity of acyclic conjunctive queries
Journal of the ACM (JACM)
Deciding first-order properties of locally tree-decomposable structures
Journal of the ACM (JACM)
Back and forth between guarded and modal logics
ACM Transactions on Computational Logic (TOCL)
Modal Logic over Finite Structures
Journal of Logic, Language and Information
Query evaluation via tree-decompositions
Journal of the ACM (JACM)
Modal and Guarded Characterisation Theorems over Finite Transition Systems
LICS '02 Proceedings of the 17th Annual IEEE Symposium on Logic in Computer Science
Modal Characterisation Theorems over Special Classes of Frames
LICS '05 Proceedings of the 20th Annual IEEE Symposium on Logic in Computer Science
Graphs and Hypergraphs
The Description Logic Handbook
The Description Logic Handbook
LICS '10 Proceedings of the 2010 25th Annual IEEE Symposium on Logic in Computer Science
Highly Acyclic Groups, Hypergraph Covers and the Guarded Fragment
LICS '10 Proceedings of the 2010 25th Annual IEEE Symposium on Logic in Computer Science
Highly Acyclic Groups, Hypergraph Covers and the Guarded Fragment
LICS '10 Proceedings of the 2010 25th Annual IEEE Symposium on Logic in Computer Science
Groupoids, Hypergraphs, and Symmetries in Finite Models
LICS '13 Proceedings of the 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science
| Hi-index | 0.00 |
We construct finite groups whose Cayley graphs have large girth even with respect to a discounted distance measure that contracts arbitrarily long sequences of edges from the same color class (subgroup), and only counts transitions between color classes (cosets). These groups are shown to be useful in the construction of finite bisimilar hypergraph covers that avoid any small cyclic configurations. We present two applications to the finite model theory of the guarded fragment: a strengthening of the known finite model property for GF and the characterization of GF as the guarded bisimulation invariant fragment of first-order logic in the sense of finite model theory.