Lower Bounds for Approximate Knowledge Compilation.
Alexis de ColnetStefan MengelPublished in: IJCAI (2020)
Keyphrases
- knowledge compilation
- lower bound
- product configuration
- upper bound
- objective function
- branch and bound algorithm
- model counting
- logical inference
- branch and bound
- prime implicates
- quantified boolean formulae
- worst case
- np hard
- decision support
- constraint satisfaction problems
- vc dimension
- upper and lower bounds
- polynomial size
- constraint satisfaction
- information retrieval
- cnf formula
- natural language
- decomposable negation normal form