Grid-Based SAT Solving with Iterative Partitioning and Clause Learning

No abstract is available for this paper.

• Publication year

  2011

• Venue

  International Conference on Principles and Practice of Constraint Programming

• Publication date

  2011-09-12

• Fields of study

  Mathematics, Computer Science

• Identifiers
  DOI 10.1007/978-3-642-23786-7_30
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Conflict-Driven Clause Learning SAT Solvers

  2021cited by this paper
• Look-Ahead Based SAT Solvers

  2021cited by this paper
• Improving Search Space Splitting for Parallel SAT Solving

  2010cited by this paper
• Synthesizing Shortest Linear Straight-Line Programs over GF(2) Using SAT

  2010cited by this paper
• Partitioning SAT Instances for Distributed Solving

  2010cited by this paper
• Practical algorithms for unsatisfiability proof and core generation in SAT solvers

  2010cited by this paper
• Lingeling, Plingeling, PicoSAT and PrecoSAT at SAT Race 2010

  2010cited by this paper
• Incorporating Clause Learning in Grid-Based Randomized SAT Solving

  2009cited by this paper
• Synthesizing Filtering Algorithms for Global Chance-Constraints

  2009cited by this paper
• Tarmo: A Framework for Parallelized Bounded Model Checking

  2009cited by this paper
• ManySAT: a Parallel SAT Solver

  2009cited by this paper
• PaMiraXT: Parallel SAT Solving with Threads and Message Passing

  2009cited by this paper
• Confidence-Based Work Stealing in Parallel Constraint Programming

  2009cited by this paper
• Partitioning Search Spaces of a Randomized Search

  2009cited by this paper
• Handbook of satisfiability

  2009cited by this paper
• Complexity of Determining Nonemptiness of the Core

  2009cited by this paper
• Principles and Practice of Constraint Programming - CP 2007, 13th International Conference, CP 2007, Providence, RI, USA, September 23-27, 2007, Proceedings

  2007cited by this paper
• Monodi fragments of rst-order temporallogi s : 2000 { 2001

  2007cited by this paper
• Parallelizing Constraint Programs Transparently

  2007cited by this paper
• A Distribution Method for Solving SAT in Grids

  2006cited by this paper
• Theory and Applications of Satisfiability Testing - SAT 2006, 9th International Conference, Seattle, WA, USA, August 12-15, 2006, Proceedings

  2006cited by this paper
• GridSAT: a system for solving satisfiability problems using a computational grid

  2006cited by this paper
• A Parallelization Scheme Based on Work Stealing for a Class of SAT Solvers

  2005cited by this paper
• Parallel propositional satisfiability checking with distributed dynamic learning

  2003cited by this paper
• Temporal induction by incremental SAT solving

  2003cited by this paper
• Chaff: engineering an efficient SAT solver

  2001cited by this paper
• GRASP: A Search Algorithm for Propositional Satisfiability

  1999cited by this paper
• An Economics Approach to Hard Computational Problems

  1997cited by this paper
• PSATO: a Distributed Propositional Prover and its Application to Quasigroup Problems

  1996cited by this paper
• A fast parallel SAT-solver — efficient workload balancing

  1996cited by this paper
• Annals of Mathematics and Artificial Intelligence

  1994cited by this paper
• Optimal speedup of Las Vegas algorithms

  1993cited by this paper
• Superlinear Speedup for Parallel Backtracking

  1987cited by this paper

• Multi-step partitioning combined with SOM neural network-based clustering technique effectively improves SAT solver performance

  2025cites this paper
• Decomposing Hard SAT Instances with Metaheuristic Optimization

  2023cites this paper
• Migrating Solver State

  2022cites this paper
• Adaptive Parallelization for Constraint Satisfaction Search

  2021influential citation
• Memory Efficient Parallel SAT Solving with Inprocessing

  2019cites this paper
• Cube-and-Conquer for Satisfiability

  2018cites this paper
• Solution Space Adjustable CNF Obfuscation for Privacy-Preserving SAT Solving

  2018cites this paper
• Privacy-Preserving SAT Solving Based on Projection-Equivalence CNF Obfuscation

  2018cites this paper
• Dissolve: A Distributed SAT Solver Based on Stalmarck's Method

  2017cites this paper
• An AMaze-ing SAT Solving Visualization

  2017cites this paper
• Solving Weakened Cryptanalysis Problems for the Bivium Keystream Generator in the Volunteer Computing Project SAT

  2015cites this paper
• HordeSat: A Massively Parallel Portfolio SAT Solver

  2015influential citation
• Hints Revealed

  2015cites this paper
• Dolius: A Distributed Parallel SAT Solving Framework

  2014cites this paper
• Communication in Massively-Parallel SAT Solving

  2014cites this paper
• Validating Unsatisfiability Results of Clause Sharing Parallel SAT Solvers

  2014cites this paper
• Incremental Satisfiability Solving and its Applications

  2014cites this paper
• Solving the Boolean satisfiability problem using the parallel paradigm

  2014cites this paper
• Structure-aware CNF obfuscation for privacy-preserving SAT solving

  2014cites this paper
• An Effective Distributed D&C Approach for the Satisfiability Problem

  2014cites this paper
• Soundness of Inprocessing in Clause Sharing SAT Solvers

  2013cites this paper
• Asynchronous Multi-core Incremental SAT Solving

  2013cites this paper
• Sharing Information in Parallel Search with Search Space Partitioning

  2013influential citation
• Modern Cooperative Parallel SAT Solving

  2013influential citation
• On estimating total time to solve SAT in distributed computing environments: Application to the SAT@home project

  2013cites this paper
• Un nouveau cadre diviser pour régner pour SAT distribué

  2013cites this paper
• SAT encodings: from constraint-based termination analysis to circuit synthesis

  2012cites this paper
• Massively Parallel Local Search for SAT

  2012cites this paper
• Designing Scalable Parallel SAT Solvers

  2012cites this paper
• Résolution parallèle de SAT : mieux collaborer pour aller plus loin

  2012cites this paper
• Concurrent Cube-and-Conquer - (Poster Presentation)

  2012cites this paper
• A Hybrid Paradigm for Adaptive Parallel Search

  2012cites this paper
• A short overview on modern parallel SAT-solvers

  2011cites this paper
• Modern Parallel SAT-Solvers

  2011cites this paper
• Cube and Conquer: Guiding CDCL SAT Solvers by Lookaheads

  2011influential citation
• SAT COMPETITION 2016 Solver and Benchmark Descriptions

  year unknowncites this paper