Achieving New Upper Bounds for the Hypergraph Duality Problem through Logic.
Georg GottlobEnrico MaliziaPublished in: SIAM J. Comput. (2018)
Keyphrases
- upper bound
- lower bound
- upper and lower bounds
- worst case
- higher order
- lower and upper bounds
- tight bounds
- modal logic
- logic programming
- branch and bound
- branch and bound algorithm
- pairwise
- generalization error
- predicate logic
- np hard
- classical logic
- sample complexity
- linear programming
- automated reasoning
- vc dimension
- defeasible logic
- asynchronous circuits
- efficiently computable
- upper bounding
- tight upper and lower bounds
- knowledge base
- concept classes
- deontic logic
- error probability
- hypergraph model