Counting List Homomorphisms from Graphs of Bounded Treewidth: Tight Complexity Bounds.
Jacob FockeDániel MarxPawel RzazewskiPublished in: ACM Trans. Algorithms (2024)
Keyphrases
- bounded treewidth
- conjunctive queries
- tight complexity bounds
- np complete
- monadic datalog
- query answering
- decision procedures
- query evaluation
- integrity constraints
- query language
- data complexity
- special case
- decision problems
- data exchange
- description logics
- graph theory
- query rewriting
- np hard
- relational databases
- first order logic
- machine learning
- knowledge representation
- data sources
- theorem proving
- relational learning
- data model
- bounded degree
- expert systems
- learning algorithm