Filters








25 Hits in 4.8 sec

EPiC Series in Computing Unsatisfiability Proofs for Parallel SAT Solver Portfolios with Clause Sharing and Inprocessing

Tobias Philipp
2016 Pages 24-38 GCAI 2016. 2nd Global Conference on Artificial Intelligence   unpublished
In Plingeling, each solver in the portfolio applies clause addition and elimination techniques. Clause sharing is restricted to clauses that do not contain melted literals.  ...  State-of-the-art SAT solvers are highly tuned systematic-search procedures augmented with formula simplification techniques.  ...  For parallel SAT solvers based on the instance decomposition approach, formal models and proof formats exist such as [21, 40] , and also formalisms that model some portfolios with arbritrary clause sharing  ... 
fatcat:pzc4nndiu5hsxpbka3j52ehw4m

Soundness of Inprocessing in Clause Sharing SAT Solvers [chapter]

Norbert Manthey, Tobias Philipp, Christoph Wernhard
2013 Lecture Notes in Computer Science  
We present a formalism that models the computation of clause sharing portfolio solvers with inprocessing.  ...  The soundness of these solvers is not a straightforward property since shared clauses can make a formula unsatisfiable.  ...  Acknowledgments The authors would like to thank Armin Biere for insights into the architecture of Plingeling.  ... 
doi:10.1007/978-3-642-39071-5_4 fatcat:3d7yis53kzbxnpdyd56i222fga

Lazy Clause Exchange Policy for Parallel SAT Solvers [chapter]

Gilles Audemard, Laurent Simon
2014 Lecture Notes in Computer Science  
Managing learnt clauses among a parallel, memory shared, SAT solver is a crucial but difficult task.  ...  and decreasing propagation speed.  ...  For a parallel portfolio SAT solver, it is not desirable to share as many clauses as possible and, obviously, each of the clause-sharing portfolio approaches mentioned above had to develop its own strategy  ... 
doi:10.1007/978-3-319-09284-3_15 fatcat:jwbn4zlso5dlpowhmwiwt32zny

Concurrent Clause Strengthening [chapter]

Siert Wieringa, Keijo Heljanko
2013 Lecture Notes in Computer Science  
The proposed technique can be applied in combination with existing parallel SAT solving techniques, including both portfolio and search space splitting approaches.  ...  More concretely, our work extends a conventional CDCL SAT solver with a second computation thread, which is solely used to strengthen the clauses learned by the solver.  ...  Recall that PeneLoPe is a portfolio solver using homogeneous solver threads and clause sharing.  ... 
doi:10.1007/978-3-642-39071-5_10 fatcat:dly7flh4q5gjthsi5satcox2da

Parallel Solving of Quantified Boolean Formulas [chapter]

Florian Lonsing, Martina Seidl
2018 Handbook of Parallel Constraint Reasoning  
In this chapter, we review and compare approaches for solving QBFs in parallel.  ...  Already in the very early stages of QBF solving history, attempts have been made to parallelize the solving process, either by splitting the search space or by portfolio-based approaches.  ...  However, in contrast to parallel SAT solving, where portfolio solvers are well studied and established (see Chapter ??), few parallel portfolio QBF solvers have been presented.  ... 
doi:10.1007/978-3-319-63516-3_4 fatcat:i4s2rjgx3zfi3ll7npc77poiua

HordeQBF: A Modular and Massively Parallel QBF Solver [chapter]

Tomáš Balyo, Florian Lonsing
2016 Lecture Notes in Computer Science  
The recently developed massively parallel satisfiability (SAT) solver HordeSAT was designed in a modular way to allow the integration of any sequential CDCL-based SAT solver in its core.  ...  We integrated the QCDCL-based quantified Boolean formula (QBF) solver DepQBF in HordeSAT to obtain a massively parallel QBF solver---HordeQBF.  ...  Parallel solving approaches have also been presented for quantified CSPs [24] and non-PCNF QBFs [21] . HordeQBF is a parallel portfolio solver with clause and cube sharing.  ... 
doi:10.1007/978-3-319-40970-2_33 fatcat:rspy7uzybbgmba4pjijspnyg2a

A review of literature on parallel constraint solving

IAN P. GENT, IAN MIGUEL, PETER NIGHTINGALE, CIARAN MCCREESH, PATRICK PROSSER, NEIL C. A. MOORE, CHRIS UNSWORTH
2018 Theory and Practice of Logic Programming  
; whether to use static or dynamic decomposition; and how to best exploit portfolios and cooperating search.  ...  Researchers need to address a number of issues to exploit parallelism, such as: investigating which constraint algorithms are amenable to parallelisation; whether to use shared memory or distributed computation  ...  Acknowledgements We thank Christopher Jefferson for a number of useful discussions, and the reviewers of this journal for their suggestions, which greatly improved this paper.  ... 
doi:10.1017/s1471068418000340 fatcat:42hcmkwlgnayhkmn7w7ypzeh3m

A Review of Literature on Parallel Constraint Solving [article]

Ian P. Gent and Ciaran McCreesh and Ian Miguel and Neil C.A. Moore and Peter Nightingale and Patrick Prosser and Chris Unsworth
2018 arXiv   pre-print
; whether to use static or dynamic decomposition; and how to best exploit portfolios and cooperating search.  ...  Researchers need to address a number of issues to exploit parallelism, such as: investigating which constraint algorithms are amenable to parallelisation; whether to use shared memory or distributed computation  ...  Finally, we thank Enrico Pontelli for kindly granting an extension to the deadline when multiple authors of this paper were (in parallel) suffering illness or other problems.  ... 
arXiv:1803.10981v1 fatcat:ramac3tqfrephdxq7gca3tglei

Compositional Propositional Proofs [chapter]

Marijn J. H. Heule, Armin Biere
2015 Lecture Notes in Computer Science  
We present a new framework to produce clausal proofs for cube-and-conquer, arguably the most effective parallel SAT solving paradigm for hard-combinatorial problems.  ...  Many hard-combinatorial problems have only be solved by SAT solvers in a massively parallel setting.  ...  Acknowledgements The authors thank Nathan Wetzler for his helpful comments to improve the paper and acknowledge the Texas Advanced Computing Center (TACC) at The University of Texas at Austin for providing  ... 
doi:10.1007/978-3-662-48899-7_31 fatcat:efu6b4i545g5jbct6o2yef7xfy

Boolean Satisfiability Solvers and Their Applications in Model Checking

Yakir Vizel, Georg Weissenbacher, Sharad Malik
2015 Proceedings of the IEEE  
Using these ideas, contemporary SAT solvers can often handle practical instances with millions of variables and constraints.  ...  EDA researchers introduced techniques such as conflict-driven clause learning, novel branching heuristics, and efficient unit propagation. These techniques form the basis of all modern SAT solvers.  ...  Egly, and the anonymous reviewers for their helpful comments.  ... 
doi:10.1109/jproc.2015.2455034 fatcat:xl5yuqw53bbgrjf653fn3rlbwq

The Configurable SAT Solver Challenge (CSSC) [article]

Frank Hutter and Marius Lindauer and Adrian Balint and Sam Bayless and Holger Hoos and Kevin Leyton-Brown
2016 arXiv   pre-print
While this competition format rewards solvers with robust default settings, it does not reflect the situation faced by a practitioner who only cares about performance on one particular application and  ...  As a consequence, most solvers for the propositional satisfiability problem (SAT) expose parameters that allow them to be customized to a particular family of instances.  ...  We also thank the solver developers for proofreading the description of their solvers and their parameters.  ... 
arXiv:1505.01221v2 fatcat:adnsiziyaza6pejktvdzundzaa

Beyond the structure of SAT formulas

Jesús Giráldez-Cru
2016 Constraints  
Journal of Statistical Mechanics: Theory and Experiment, 2007(03):P03006. Sonobe, T., Kondoh, S., and Inaba, M. (2014). Community branching for parallel portfolio SAT solvers.  ...  Sonobe et al. [2014] use the partition obtained with the community structure to improve the performance of a parallel SAT solver.  ... 
doi:10.1007/s10601-016-9260-z fatcat:dj2feerovvfwxdk5toynlohcga

The Configurable SAT Solver Challenge (CSSC)

Frank Hutter, Marius Lindauer, Adrian Balint, Sam Bayless, Holger Hoos, Kevin Leyton-Brown
2017 Artificial Intelligence  
its authors thus discourage its use for this purpose (personal communication with Manuel López-Ibáñez and Thomas Stützle).  ...  As a consequence, most solvers for the propositional satisfiability problem (SAT) expose parameters that allow them to be customized to a particular family of instances.  ...  We also thank the solver developers for proofreading the description of their solvers and their parameters.  ... 
doi:10.1016/j.artint.2016.09.006 fatcat:vf47b3ms3nestoftcseobatzv4

Validating Unsatisfiability Results of Clause Sharing Parallel SAT Solvers

Marijn Heule, Norbert Manthey, Tobias Philipp
unpublished
Computing deletion information is easy and cheap for parallel solvers without clause sharing, but tricky for parallel solvers with clause sharing.We present a method to generate unsatisfiability proofs  ...  from clause sharing parallel SAT solvers.  ...  Acknowledgments The author thanks the ZIH of TU Dresden for providing the computational resources to produce the experimental data for the empirical evaluation.  ... 
doi:10.29007/6vwg fatcat:ruyhl5pm2rhn7csrbbvn4nmgy4

Where does SAT not work?

Armin Biere
2014
data structures for next generation SAT solvers how and why does VSIDS work?  ...  resolution speeding up CDCL by local search effectively arithmetic reasoning on the CNF level data-flow based algorithms for SAT parallel SAT solving reencoding CNF: extensions and theoretical questions  ...  approach: portfolio with clause sharing successful in the application track of the competition portfolio already gives substantial speed-up clause sharing of "good" clauses gives another boost  ... 
doi:10.14288/1.0043901 fatcat:dijz4ytti5g5jk7hh7onzbd5yq
« Previous Showing results 1 — 15 out of 25 results