Achieving new upper bounds for the hypergraph duality problem through logic.
Georg GottlobEnrico MaliziaPublished in: CSL-LICS (2014)
Keyphrases
- upper bound
- lower bound
- upper and lower bounds
- linear programming
- higher order
- branch and bound algorithm
- pairwise
- lower and upper bounds
- branch and bound
- worst case
- multi valued
- efficiently computable
- tight bounds
- generalization error
- modal logic
- np hard
- high order
- theoretical analysis
- logic programming
- automated reasoning
- classical logic
- computational properties
- predicate logic
- vc dimension
- dynamic programming
- linear logic
- error probability
- machine learning