Search from the table of contents of 2.5 million books
Advanced Search (Beta)
Home > Theory and Applications of Satisfiability Testing – SAT 2020: 23rd International Conference, Alghero, Italy, July 3–10, 2020, Proceedings > On Weakening Strategies for PB Solvers
Theory and Applications of Satisfiability Testing – SAT 2020: 23rd International Conference, Alghero, Italy, July 3–10, 2020, Proceedings |
Luca Pulina; Martina Seidl
Springer International Publishing
Theory and Applications of Satisfiability Testing – SAT 2020: 23rd International Conference, Alghero, Italy, July 3–10, 2020, Proceedings
On Weakening Strategies for PB Solvers
Authors

Daniel Le Berre; Pierre Marquis; Romain Wallon

ARI Id

1665262303514_5613638

Access

Not Available Free

Pages

322-331

DOI

10.1007/978-3-030-51825-7_23

Chapter URL

https://rd.springer.com/chapter/10.1007/978-3-030-51825-7_23

Table of Contents of Book
Showing 1 to 20 of 38 entries
Chapters/HeadingsAuthor(s)PagesInfo
Front Matter
i-xi
Sorting Parity Encodings by Reusing Variables
Leroy Chew; Marijn J. H. Heule
1-10
Community and LBD-Based Clause Sharing Policy for Parallel SAT Solving
Vincent Vallade; Ludovic Le Frioux; Souheib Baarir; Julien Sopena; Vijay Ganesh; Fabrice Kordon
11-27
Clause Size Reduction with all-UIP Learning
Nick Feng; Fahiem Bacchus
28-45
Trail Saving on Backtrack
Randy Hickey; Fahiem Bacchus
46-61
Four Flavors of Entailment
Sibylle Möhle; Roberto Sebastiani; Armin Biere
62-71
Designing New Phase Selection Heuristics
Arijit Shaw; Kuldeep S. Meel
72-88
On the Effect of Learned Clauses on Stochastic Local Search
Jan-Hendrik Lorenz; Florian Wörz
89-106
SAT Heritage: A Community-Driven Effort for Archiving, Building and Running More Than Thousand SAT Solvers
Gilles Audemard; Loïc Paulevé; Laurent Simon
107-113
Distributed Cube and Conquer with Paracooba
Maximilian Heisinger; Mathias Fleury; Armin Biere
114-122
Reproducible Efficient Parallel SAT Solving
Hidetomo Nabeshima; Katsumi Inoue
123-138
Improving Implementation of SAT Competitions 2017–2019 Winners
Stepan Kochemazov
139-148
On CDCL-Based Proof Systems with the Ordered Decision Strategy
Nathan Mull; Shuo Pang; Alexander Razborov
149-165
Equivalence Between Systems Stronger Than Resolution
Maria Luisa Bonet; Jordi Levy
166-181
Simplified and Improved Separations Between Regular and General Resolution by Lifting
Marc Vinyals; Jan Elffers; Jan Johannsen; Jakob Nordström
182-200
Mycielski Graphs and PR Proofs
Emre Yolcu; Xinyu Wu; Marijn J. H. Heule
201-217
Towards a Better Understanding of (Partial Weighted) MaxSAT Proof Systems
Javier Larrosa; Emma Rollon
218-232
Towards a Complexity-Theoretic Understanding of Restarts in SAT Solvers
Chunxiao Li; Noah Fleming; Marc Vinyals; Toniann Pitassi; Vijay Ganesh
233-249
On the Sparsity of XORs in Approximate Model Counting
Durgesh Agrawal; Bhavishya; Kuldeep S. Meel
250-266
A Faster Algorithm for Propositional Model Counting Parameterized by Incidence Treewidth
Friedrich Slivovsky; Stefan Szeider
267-276
Chapters/HeadingsAuthor(s)PagesInfo
Showing 1 to 20 of 38 entries
Similar Books
Similar Chapters
Similar Thesis

Similar News

Similar Articles
Similar Article Headings