An Improved Separation of Regular Resolution from Pool Resolution and Clause Learning

Details An Improved Separation of Regular Resolution from Pool Resolution and Clause Learning An Improved Separation of Regular Resolution from Pool Resolution and Clause Learning

2012-02-10

arxiv.org/abs/1202.2296v1

Computer Science

Logic in Computer Science

Scientific paper

We prove that the graph tautology principles of Alekhnovich, Johannsen, Pitassi and Urquhart have polynomial size pool resolution refutations that use only input lemmas as learned clauses and without degenerate resolution inferences. We also prove that these graph tautology principles can be refuted by polynomial size DPLL proofs with clause learning, even when restricted to greedy DPLL search.

Affiliated with

Also associated with

No associations

Rating

An Improved Separation of Regular Resolution from Pool Resolution and Clause Learning does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with An Improved Separation of Regular Resolution from Pool Resolution and Clause Learning, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and An Improved Separation of Regular Resolution from Pool Resolution and Clause Learning will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-276063