Incorporating Learning in Grid-Based Randomized SAT Solving

DOI10.1007/978-3-540-85776-1_21zbMATH Open1169.68603OpenAlexW1555375604MaRDI QIDQ3534664FDOQ3534664

Authors: Antti E. J. Hyvärinen, Tommi Junttila, Ilkka Niemelä 

Publication date: 4 November 2008

Published in: Artificial Intelligence: Methodology, Systems, and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-85776-1_21

Recommendations

• Incorporating clause learning in grid-based randomized SAT solving
• Strategies for Solving SAT in Grids by Randomized Search
• scientific article; zbMATH DE number 2080328
• Learning rate based branching heuristic for SAT solvers
• Solving the satisfiability problem by using randomized approach

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Randomized algorithms (68W20) Distributed algorithms (68W15)

Cited In (6)

• Learning Optimal Decision Sets and Lists with SAT
• An expressive model for instance decomposition based parallel SAT solvers
• Incorporating clause learning in grid-based randomized SAT solving
• Strategies for Solving SAT in Grids by Randomized Search
• Partitioning SAT instances for distributed solving
• Distributed bounded model checking

This page was built for publication: Incorporating Learning in Grid-Based Randomized SAT Solving

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