Minimum Propositional Proof Length Is NP-Hard to Linearly Approximate.
Michael AlekhnovichSamuel R. BussShlomo MoranToniann PitassiPublished in: J. Symb. Log. (2001)
Keyphrases
- np hard
- minimum cost
- approximate solutions
- proof procedure
- cost based abduction
- special case
- linear programming
- first order logic
- propositional logic
- optimal solution
- approximation algorithms
- theorem proving
- scheduling problem
- minimum length
- closely related
- lower bound
- theorem prover
- integer programming
- np complete
- exact solution
- classical first order logic
- worst case
- linear logic
- branch and bound algorithm
- total length
- remains np hard
- spanning tree
- maximum number
- fixed length
- np hardness
- approximate matching
- min sum