Learning to select branching rules in the DPLL procedure for satisfiability
From MaRDI portal
Recommendations
- Learning rate based branching heuristic for SAT solvers
- On the complexity of choosing the branching literal in DPLL
- DPLL: the core of modern satisfiability solvers
- Learning from conflicts in propositional satisfiability
- Proper learning of \(k\)-term DNF formulas from satisfying assignments
- Branching rules for satisfiability
- Publication:3490978
- scientific article; zbMATH DE number 1256727
- Exact learning of DNF formulas using DNF hypotheses
- Decision network semantics of branching constraint satisfaction problems
Cites work
Cited in
(12)- ILP Through Propositionalization and Stochastic k-Term DNF Learning
- Learning to branch: generalization guarantees and limits of data-independent discretization
- Machine learning and logic: a new frontier in artificial intelligence
- How good are branching rules in DPLL?
- Practical performance models of algorithms in evolutionary program induction and other domains
- A machine learning approach to algorithm selection for \(\mathcal{NP}\)-hard optimization problems: a case study on the MPE problem
- An empirical study of branching heuristics through the lens of global learning rate
- Optimization of heuristic search using recursive algorithm selection and reinforcement learning
- Theory and Applications of Satisfiability Testing
- New updating criteria for conflict-based branching heuristics in DPLL algorithms for satisfiability
- Learning rate based branching heuristic for SAT solvers
- Advances in Artificial Intelligence
This page was built for publication: Learning to select branching rules in the DPLL procedure for satisfiability
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2741536)
