Actin - Technical Report

Details Actin - Technical Report Actin - Technical Report

2007-05-10

arxiv.org/abs/0705.1481v1

Computer Science

Neural and Evolutionary Computing

15 pages

Scientific paper

The Boolean satisfiability problem (SAT) can be solved efficiently with variants of the DPLL algorithm. For industrial SAT problems, DPLL with conflict analysis dependent dynamic decision heuristics has proved to be particularly efficient, e.g. in Chaff. In this work, algorithms that initialize the variable activity values in the solver MiniSAT v1.14 by analyzing the CNF are evolved using genetic programming (GP), with the goal to reduce the total number of conflicts of the search and the solving time. The effect of using initial activities other than zero is examined by initializing with random numbers. The possibility of countering the detrimental effects of reordering the CNF with improved initialization is investigated. The best result found (with validation testing on further problems) was used in the solver Actin, which was submitted to SAT-Race 2006.

Affiliated with

Also associated with

No associations

Rating

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

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-600869