A non-elementary speed-up in proof length by structural clause form transformation
暂无分享,去创建一个
We investigate the effects of different types of translations of first-order formulas to clausal form on minimal proof length. We show that there is a sequence of unsatisfiable formulas such that the length of all refutations of non-structural clause forms of F/sub n/ is non-elementary (in the size of F/sub n/), but there are refutations of structural clause forms of F/sub n/ that are of elementary (at most triple exponential) length.<<ETX>>
[1] Alexander Leitsch,et al. Complexity of Resolution Proofs and Function Introduction , 1992, Ann. Pure Appl. Log..
[2] R. Statman. Lower bounds on Herbrand’s theorem , 1979 .
[3] Alexander Leitsch,et al. On Skolemization and Proof Complexity , 1994, Fundam. Informaticae.