Incorporating clause learning in grid-based randomized SAT solving

MaRDI QIDQ3639755zbMATH OpenFDO

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

Publication date 26 October 2009

zbMATH Keywords

computational gridsdistributed computingpropositional satisfiabilityrandomized search

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) Distributed algorithms (68W15) Randomized algorithms (68W20)

Recommendations

• Incorporating Learning in Grid-Based Randomized SAT Solving
• Strategies for Solving SAT in Grids by Randomized Search
• Partitioning SAT instances for distributed solving
• GridSAT: Design and implementation of a computational grid application
• scientific article; zbMATH DE number 2243370

Cited in

(10)

• On the effect of learned clauses on stochastic local search
• HordeSat: a massively parallel portfolio SAT solver
• Search-space partitioning for parallelizing SMT solvers
• The effect of structural branching on the efficiency of clause learning SAT solving: An experimental study
• Incorporating Learning in Grid-Based Randomized SAT Solving
• Extending Clause Learning of SAT Solvers with Boolean Gröbner Bases
• On the van der Waerden numbers \(\mathrm{w}(2; 3, t)\)
• A review of literature on parallel constraint solving
• Strategies for Solving SAT in Grids by Randomized Search
• A greedy randomized adaptive search procedure (GRASP) for inferring logical clauses from examples in polynomial time and some extensions

Describes a project that uses

Uses Software

• MiniSat
• PSATO
• SATO
• Chaff

This page was built for publication: Incorporating clause 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 Q3639755)