Learning for Dynamic subsumption

Details Learning for Dynamic subsumption Learning for Dynamic subsumption

2009-03-31

arxiv.org/abs/0904.0029v1

Computer Science

Artificial Intelligence

Scientific paper

In this paper a new dynamic subsumption technique for Boolean CNF formulae is proposed. It exploits simple and sufficient conditions to detect during conflict analysis, clauses from the original formula that can be reduced by subsumption. During the learnt clause derivation, and at each step of the resolution process, we simply check for backward subsumption between the current resolvent and clauses from the original formula and encoded in the implication graph. Our approach give rise to a strong and dynamic simplification technique that exploits learning to eliminate literals from the original clauses. Experimental results show that the integration of our dynamic subsumption approach within the state-of-the-art SAT solvers Minisat and Rsat achieves interesting improvements particularly on crafted instances.

Affiliated with

Also associated with

No associations

Rating

Learning for Dynamic subsumption 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 Learning for Dynamic subsumption, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Learning for Dynamic subsumption will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-592883