Finite variable counting logics with restricted requantification
From MaRDI portal
Cites work
- An optimal lower bound on the number of variables for graph identification
- Canonisation and Definability for Graphs of Bounded Rank Width
- Canonizing Graphs of Bounded Tree Width in Logspace
- Compressing CFI graphs and lower bounds for the Weisfeiler-Leman refinements
- Counting bounded tree depth homomorphisms
- Descriptive Complexity, Canonisation, and Definable Graph Structure Theory
- Embedding and canonizing graphs of bounded genus in logspace
- Expressive completeness of two-variable first-order logic with counting for first-order logic queries on rooted unranked trees
- Fixed-point definability and polynomial time on graphs with excluded minors
- Going deep and going wide: counting logic and homomorphism indistinguishability over graphs of bounded treedepth and treewidth
- scientific article; zbMATH DE number 1254648 (Why is no real title available?)
- scientific article; zbMATH DE number 1754602 (Why is no real title available?)
- scientific article; zbMATH DE number 7561610 (Why is no real title available?)
- Learning concepts definable in first-order logic with counting
- Logical complexity of graphs: a survey
- Logical hierarchies in PTIME
- Logspace and FPT algorithms for graph isomorphism for subclasses of bounded tree-width graphs
- Lov\'asz Meets Weisfeiler and Leman
- On recognizing graphs by numbers of homomorphisms
- Planar graph isomorphism is in log-space
- Relational queries computable in polynomial time
- The logic of graph neural networks
- The Power of Counting Logics on Restricted Classes of Finite Structures
- The Weisfeiler--Leman Dimension of Planar Graphs Is at Most 3
- Tree-depth, subgraph coloring and homomorphism bounds
Cited in
(1)
This page was built for publication: Finite variable counting logics with restricted requantification
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7261420)
