Weighted Model Counting in FO2 with Cardinality Constraints and Counting Quantifiers: A Closed Form Formula.
Sagar MalhotraLuciano SerafiniPublished in: CoRR (2021)
Keyphrases
- closed form
- weighted model counting
- model counting
- cardinality constraints
- propositional formulas
- constraint query languages
- first order logic
- propositional logic
- expressive power
- boolean algebra
- constraint databases
- inference rules
- probabilistic inference
- polynomial size
- knowledge compilation
- bayesian inference
- normal form
- satisfiability testing
- functional dependencies
- entity relationship
- deductive databases
- natural language
- knowledge representation
- cnf formula
- relational model
- integrity constraints
- boolean functions
- database schema