Tractable Bounding of Counterfactual Queries by Knowledge Compilation.
David HuberYizuo ChenAlessandro AntonucciAdnan DarwicheMarco ZaffalonPublished in: CoRR (2023)
Keyphrases
- knowledge compilation
- prime implicates
- model counting
- product configuration
- query language
- database
- normal form
- quantified boolean formulae
- query processing
- polynomial size
- upper bound
- np complete
- query evaluation
- belief change
- horn formulas
- constraint satisfaction problems
- desirable properties
- np hard
- data model
- logical inference
- decomposable negation normal form
- dnf formulas
- decision support
- data sources
- database systems
- databases