Fast Counting with Bounded Treewidth.
Michael JaklReinhard PichlerStefan RümmeleStefan WoltranPublished in: LPAR (2008)
Keyphrases
- bounded treewidth
- monadic datalog
- np complete
- model counting
- decision problems
- highly parallelizable
- polynomial size
- conjunctive queries
- boolean functions
- database
- fixed parameter tractable
- tractable cases
- relational learning
- graph theoretic
- constraint satisfaction problems
- np hard
- bayesian networks
- machine learning
- databases