Learning in a compiler for MINSAT algorithms

DOI10.1017/S147106840200162XMaRDI QIDQ4452595zbMATH OpenWikidataFDO

Authors Anja Remshagen, Klaus Truemper

Publication date 1 March 2004

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

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)

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

Cited in

(4)

• A MINSAT approach for learning in logic domains
• 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)