Going Deep and Going Wide: Counting Logic and Homomorphism Indistinguishability over Graphs of Bounded Treedepth and Treewidth.
Eva FluckTim SeppeltGian Luca SpitzerPublished in: CoRR (2023)
Keyphrases
- bounded treewidth
- np complete
- decision problems
- logic programming
- upper bound
- boolean functions
- conjunctive queries
- search space
- multi valued
- wide range
- truth table
- automated reasoning
- graph matching
- classical logic
- t norm
- constraint graph
- database views
- graph structure
- graph representation
- schema mappings
- space complexity
- graph theoretic
- expressive power
- np hard
- predicate logic
- special case
- discrete random variables
- objective function