Partitioning search spaces of a randomized search

DOI10.3233/FI-2011-404MaRDI QIDQ3100181zbMATH OpenOpenAlexFDO

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

Publication date 22 November 2011

Published in Fundamenta Informaticae (Search for Journal in Brave)

Full work available at URL https://doi.org/10.3233/fi-2011-404

zbMATH Keywords

SAT solvingrandomized searchdistributed constraint-based search

Mathematics Subject Classification ID

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

Recommendations

• Partitioning SAT instances for distributed solving
• Search-space partitioning for parallelizing SMT solvers
• scientific article; zbMATH DE number 1929156
• Stochastic systematic search algorithms for satisfiability
• Probabilistic approach to the satisfiability problem

Cited in

(4)

• Search-space partitioning for parallelizing SMT solvers
• Strategies for Solving SAT in Grids by Randomized Search
• Partitioning SAT instances for distributed solving
• Random search in a bounded area

Describes a project that uses

Uses Software

• PaQuBE
• PaMiraXT
• SATO
• PSATO
• MiniSat
• ManySAT

This page was built for publication: Partitioning search spaces of a randomized search

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