Learning in a compiler for MINSAT algorithms

DOI10.1017/S147106840200162XzbMATH Open1069.68540WikidataQ122653312 ScholiaQ122653312MaRDI QIDQ4452595FDOQ4452595

Klaus Truemper, Anja Remshagen

Publication date: 1 March 2004

Published in: Theory and Practice of Logic Programming (Search for Journal in Brave)

Recommendations

• A MINSAT approach for learning in logic domains
• Learning in search
• Learn with SAT to minimize Büchi automata
• Learning rate based branching heuristic for SAT solvers
• Minimaxsat: an efficient weighted Max-SAT solver

zbMATH Keywords

propositional logiccompiler for logiclearning lemmaslogic minimization problem

Mathematics Subject Classification ID

Classical propositional logic (03B05) Logic programming (68N17) Theory of compilers and interpreters (68N20)

Cited In (3)

• On the Complexity of Learning Minimum Time-Bounded Turing Machines
• Accurately learning from few examples with a polyhedral classifier
• LARS: a learning algorithm for rewriting systems

This page was built for publication: Learning in a compiler for MINSAT algorithms

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4452595)