Michael Ray, Yves C. Martin
Proceedings of SPIE - The International Society for Optical Engineering
For infinitely many n > 0 we construct contradictory formulas αn in conjunctive form with n literals such that every regular proof tree which proves the contradiction must contain 2cn distinct clauses for some c > 0. This implies a 2cn lower bound for the number of distinct clauses which are generated by the Davis-Putnam procedure applied to αn using any order of variable elimination. © 1977.
Michael Ray, Yves C. Martin
Proceedings of SPIE - The International Society for Optical Engineering
Robert C. Durbeck
IEEE TACON
Reena Elangovan, Shubham Jain, et al.
ACM TODAES
Israel Cidon, Leonidas Georgiadis, et al.
IEEE/ACM Transactions on Networking