Achieving New Upper Bounds for the Hypergraph Duality Problem through Logic.
Georg GottlobEnrico MaliziaPublished in: CoRR (2014)
Keyphrases
- upper bound
- lower bound
- upper and lower bounds
- tight bounds
- lower and upper bounds
- branch and bound
- worst case
- higher order
- linear programming
- vc dimension
- upper bounding
- classical logic
- pairwise
- modal logic
- multi valued
- logic programming
- efficiently computable
- automated reasoning
- computational properties
- knowledge base
- neural network
- high order
- error probability
- proof theory
- digital circuits
- defeasible logic
- concept classes
- dynamic programming
- scheduling problem
- first order logic