Going Deep and Going Wide: Counting Logic and Homomorphism Indistinguishability over Graphs of Bounded Treedepth and Treewidth.
Eva FluckTim SeppeltGian Luca SpitzerPublished in: CSL (2024)
Keyphrases
- bounded treewidth
- np complete
- decision problems
- boolean functions
- conjunctive queries
- truth table
- multi valued
- logic programming
- graph structure
- relational learning
- upper bound
- graph matching
- modal logic
- automated reasoning
- classical logic
- search space
- space complexity
- graph theory
- graph mining
- graph model
- directed graph
- graph theoretic
- data management
- t norm
- predicate logic
- graphical models