The effect of structural branching on the efficiency of clause learning SAT solving: An experimental study

DOI10.1016/J.JALGOR.2008.02.005MaRDI QIDQ3527696zbMATH OpenOpenAlexFDO

Authors Matti Järvisalo, Ilkka Niemelä

Publication date 29 September 2008

Published in Journal of Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.jalgor.2008.02.005

zbMATH Keywords

backdoor setsbranching heuristicsclause learningproblem structurepropositional satisfiability

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Recommendations

• On the power of clause-learning SAT solvers as resolution engines
• Incorporating clause learning in grid-based randomized SAT solving
• Boosting branch-and-bound MaxSAT solvers with clause learning
• Learning rate based branching heuristic for SAT solvers
• Speeding-Up Non-clausal Local Search for Propositional Satisfiability with Clause Learning
• Clause simplifications in search-space decomposition-based SAT solvers
• Extending Clause Learning of SAT Solvers with Boolean Gröbner Bases

Cited in

(7)

• An empirical study of branching heuristics through the lens of global learning rate
• Learning pseudo-backdoors for mixed integer programs
• Limitations of restricted branching in clause learning
• Backdoors to tractable answer set programming
• Learning rate based branching heuristic for SAT solvers
• Limitations of Restricted Branching in Clause Learning
• Theory and Applications of Satisfiability Testing

Describes a project that uses

Uses Software

• Chaff
• BerkMin
• MiniSat

This page was built for publication: The effect of structural branching on the efficiency of clause learning SAT solving: An experimental study

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