Strategies for Solving SAT in Grids by Randomized Search

DOI10.1007/978-3-540-85110-3_11MaRDI QIDQ5505494zbMATH OpenOpenAlexFDO

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

Publication date 27 January 2009

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-85110-3_11

Mathematics Subject Classification ID

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

Recommendations

• Incorporating Learning in Grid-Based Randomized SAT Solving
• GridSAT: Design and implementation of a computational grid application
• Incorporating clause learning in grid-based randomized SAT solving
• Partitioning SAT instances for distributed solving
• Partitioning search spaces of a randomized search

Cited in

(6)

• The SAT+CAS method for combinatorial search with applications to best matrices
• scientific article; zbMATH DE number 5139164 (Why is no real title available?)
• Incorporating Learning in Grid-Based Randomized SAT Solving
• Incorporating clause learning in grid-based randomized SAT solving
• A volunteer-computing-based grid architecture incorporating idle resources of computational clusters
• STACS 2004

Describes a project that uses

Uses Software

• MiniSat
• GridSAT
• PSATO
• SATO
• ZetaSAT
• GridJM

This page was built for publication: Strategies for Solving SAT in Grids by Randomized Search

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