Learning in a Compiler for MINSAT Algorithms
<|reference_start|>Learning in a Compiler for MINSAT Algorithms: 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.<|reference_end|>
@article{remshagen2003learning,
    title={Learning in a Compiler for MINSAT Algorithms},
    author={Anja Remshagen and Klaus Truemper},
    journal={Theory and practice of Logic Programming, Vol 3(3), pp 271-286,
  2003},
    year={2003},
    archivePrefix={arXiv},
    eprint={cs/0312032},
    primaryClass={cs.LO}
}