Simplified Lower Bounds for Propositional Proofs.
Alasdair UrquhartXudong FuPublished in: Notre Dame J. Formal Log. (1996)
Keyphrases
- lower bound
- upper bound
- branch and bound algorithm
- propositional logic
- first order logic
- theorem proving
- objective function
- theorem prover
- lower and upper bounds
- worst case
- branch and bound
- np hard
- default logic
- vc dimension
- upper and lower bounds
- lower bounding
- proof procedure
- equational theories
- optimal solution
- scheduling problem
- multi valued
- linear programming relaxation
- mathematical proofs
- linear programming
- formal proof
- polynomial approximation
- natural deduction
- probabilistic logic
- horn clauses
- sample complexity
- learning algorithm