Lower Bounds for Approximate Knowledge Compilation.
Alexis de ColnetStefan MengelPublished in: CoRR (2020)
Keyphrases
- knowledge compilation
- lower bound
- product configuration
- upper bound
- prime implicates
- logical inference
- branch and bound algorithm
- model counting
- quantified boolean formulae
- branch and bound
- normal form
- np hard
- constraint satisfaction problems
- polynomial size
- optimal solution
- upper and lower bounds
- decomposable negation normal form
- concept class
- vc dimension
- database design
- computational complexity
- natural language
- database systems