SAT-Based Horn Least Upper Bounds.
Carlos MencíaAlessandro PrevitiJoão Marques-SilvaPublished in: SAT (2015)
Keyphrases
- upper bound
- lower bound
- np hard
- answer set programming
- bounded model checking
- upper and lower bounds
- sat solvers
- boolean satisfiability
- branch and bound algorithm
- lower and upper bounds
- tight bounds
- version space
- ai planning
- worst case
- constraint solver
- horn theories
- branch and bound
- concept classes
- tight upper and lower bounds
- planning domains
- propositional logic
- vc dimension
- constraint networks
- answer sets
- linear programming
- horn logic
- knowledge compilation
- integer programming
- formal verification
- linear program
- np complete
- scheduling problem
- efficiently computable
- search space
- optimal solution