Tight Complexity Bounds for Counting Generalized Dominating Sets in Bounded-Treewidth Graphs.
Jacob FockeDániel MarxFionn Mc InerneyDaniel NeuenGovind S. SankarPhilipp SchepperPhilip WellnitzPublished in: CoRR (2022)
Keyphrases
- bounded treewidth
- conjunctive queries
- tight complexity bounds
- np complete
- monadic datalog
- query answering
- query evaluation
- data complexity
- decision problems
- decision procedures
- special case
- integrity constraints
- boolean functions
- query rewriting
- query language
- data mining
- metadata
- learning algorithm
- datalog programs
- machine learning
- bounded degree
- artificial intelligence
- relational learning
- relational databases