Complexity of Weighted First-Order Model Counting in the Two-Variable Fragment with Counting Quantifiers: A Bound to Beat.
Jan TóthOndrej KuzelkaPublished in: CoRR (2024)
Keyphrases
- model counting
- polynomial size
- weighted model counting
- boolean functions
- knowledge compilation
- worst case
- first order logic
- dnf formulas
- bounded treewidth
- satisfiability testing
- upper bound
- lower bound
- natural language
- random instances
- logic programs
- probabilistic inference
- uniform distribution
- propositional formulas