Learning in a Compiler for MINSAT Algorithms

Details Learning in a Compiler for MINSAT Algorithms Learning in a Compiler for MINSAT Algorithms

2003-12-16

arxiv.org/abs/cs/0312032v1

Theory and practice of Logic Programming, Vol 3(3), pp 271-286, 2003

Computer Science

Logic in Computer Science

16 pages

Scientific paper

This paper describes learning in a compiler for algorithms solving classes of the logic minimization problem MINSAT, where the underlying propositional formula is in conjunctive normal form (CNF) and where costs are associated with the True/False values of the variables. Each class consists of all instances that may be derived from a given propositional formula and costs for True/False values by fixing or deleting variables, and by deleting clauses. The learning step begins once the compiler has constructed a solution algorithm for a given class. The step applies that algorithm to comparatively few instances of the class, analyses the performance of the algorithm on these instances, and modifies the underlying propositional formula, with the goal that the algorithm will perform much better on all instances of the class.

Affiliated with

Also associated with

No associations

Rating

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

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-511029