Partitioning SAT instances for distributed solving

DOI10.1007/978-3-642-16242-8_27MaRDI QIDQ4933318zbMATH OpenOpenAlexFDO

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

Publication date 12 October 2010

Published in Logic for Programming, Artificial Intelligence, and Reasoning (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-16242-8_27

Mathematics Subject Classification ID

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

Recommendations

• Partitioning search spaces of a randomized search
• Search-space partitioning for parallelizing SMT solvers
• Partitioning methods for satisfiability testing on large formulas
• Incorporating Learning in Grid-Based Randomized SAT Solving
• Solving SAT in a distributed cloud: a portfolio approach

Cited in

(17)

• Partitioning methods for satisfiability testing on large formulas
• Solving SAT in a distributed cloud: a portfolio approach
• Computing in the fractal cloud: modular generic solvers for SAT and Q-SAT variants
• An expressive model for instance decomposition based parallel SAT solvers
• Partitioning search spaces of a randomized search
• Community branching for parallel portfolio SAT solvers
• HordeSat: a massively parallel portfolio SAT solver
• Search-space partitioning for parallelizing SMT solvers
• Compositional propositional proofs
• Incorporating clause learning in grid-based randomized SAT solving
• On the van der Waerden numbers \(\mathrm{w}(2; 3, t)\)
• Partitioning methods for satisfiability testing on large formulas
• On black-box optimization in divide-and-conquer SAT solving
• Finding Effective SAT Partitionings Via Black-Box Optimization
• Strategies for Solving SAT in Grids by Randomized Search
• Unsatisfiability proofs for distributed clause-sharing SAT solvers
• A competitive and cooperative approach to propositional satisfiability

Describes a project that uses

Uses Software

• ManySAT
• March_eq
• MiniSat
• PSATO
• SATO
• Plingeling
• PrecoSAT

This page was built for publication: Partitioning SAT instances for distributed solving

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