default search action
20th SAT 2017: Melbourne, VIC, Australia
- Serge Gaspers, Toby Walsh:
Theory and Applications of Satisfiability Testing - SAT 2017 - 20th International Conference, Melbourne, VIC, Australia, August 28 - September 1, 2017, Proceedings. Lecture Notes in Computer Science 10491, Springer 2017, ISBN 978-3-319-66262-6
Algorithms, Complexity, and Lower Bounds
- Dimitris Achlioptas, Panos Theodoropoulos:
Probabilistic Model Counting with Short XORs. 3-19 - Robert Ganian, M. S. Ramanujan, Stefan Szeider
:
Backdoor Treewidth for SAT. 20-37 - Robert Ganian, Stefan Szeider
New Width Parameters for Model Counting. 38-52 - Dmitry Itsykson, Alexander Knop
Hard Satisfiable Formulas for Splittings by Linear Combinations. 53-61
Clause Learning and Symmetry Handling
- Guillaume Baud-Berthier, Jesús Giráldez-Cru
On the Community Structure of Bounded Model Checking SAT Problems. 65-82 - Jo Devriendt, Bart Bogaerts
Symmetric Explanation Learning: Effective Dynamic Symmetry Handling for SAT. 83-100 - Tommi A. Junttila, Matti Karppa
An Adaptive Prefix-Assignment Technique for Symmetry Reduction. 101-118 - Jia Hui Liang, Hari Govind V. K., Pascal Poupart, Krzysztof Czarnecki, Vijay Ganesh
An Empirical Study of Branching Heuristics Through the Lens of Global Learning Rate. 119-135 - Hidetomo Nabeshima, Katsumi Inoue
Coverage-Based Clause Reduction Heuristics for CDCL Solvers. 136-144
Maximum Satisfiability and Minimal Correction Sets
- Eldan Cohen, Guoyu Huang, J. Christopher Beck:
(I Can Get) Satisfaction: Preference-Based Scheduling for Concert-Goers at Multi-venue Music Festivals. 147-163 - Alexey Ignatiev
On Tackling the Limits of Resolution in SAT Solving. 164-183 - Alessandro Previti, Carlos Mencía
Improving MCS Enumeration via Caching. 184-194 - Miguel Terra-Neves, Inês Lynce
Introducing Pareto Minimal Correction Subsets. 195-211
Parallel SAT Solving
- Gilles Audemard, Jean-Marie Lagniez, Nicolas Szczepanski, Sébastien Tabary:
A Distributed Version of Syrup. 215-232 - Ludovic Le Frioux, Souheib Baarir, Julien Sopena, Fabrice Kordon:
PaInleSS: A Framework for Parallel SAT Solving. 233-250 - Saeed Nejati, Zack Newsham, Joseph Scott, Jia Hui Liang, Catherine H. Gebotys, Pascal Poupart, Vijay Ganesh
A Propagation Rate Based Splitting Heuristic for Divide-and-Conquer Solvers. 251-260
Quantified Boolean Formulas
- Joshua Blinkhorn, Olaf Beyersdorff
Shortening QBF Proofs with Dependency Schemes. 263-280 - Benjamin Kiesl, Marijn J. H. Heule, Martina Seidl:
A Little Blocked Literal Goes a Long Way. 281-297 - Tomás Peitl, Friedrich Slivovsky, Stefan Szeider
Dependency Learning for QBF. 298-313 - Markus N. Rabe:
A Resolution-Style Proof System for DQBF. 314-325 - Ralf Wimmer
From DQBF to QBF by Dependency Elimination. 326-343
Satisfiability Modulo Theories
- Antti E. J. Hyvärinen, Sepideh Asadi
Theory Refinement for Program Verification. 347-363 - Martin Jonás
On Simplification of Formulas with Unconstrained Variables and Quantifiers. 364-379 - Bishoksan Kafle, Graeme Gange
A Benders Decomposition Approach to Deciding Modular Linear Integer Arithmetic. 380-397
SAT Encodings
- Johannes Klaus Fichte, Neha Lodha, Stefan Szeider
SAT-Based Local Improvement for Finding Tree Decompositions of Small Width. 401-411 - Petr Kucera, Petr Savický, Vojtech Vorel:
A Lower Bound on CNF Encodings of the At-Most-One Constraint. 412-428 - Neha Lodha, Sebastian Ordyniak, Stefan Szeider
SAT-Encodings for Special Treewidth and Pathwidth. 429-445
Tool Papers
- Tuukka Korhonen
MaxPre: An Extended MaxSAT Preprocessor. 449-456 - Peter Lammich:
The GRAT Tool Chain - Efficient (UN)SAT Certificate Checking with Formal Correctness Guarantees. 457-463 - Massimo Lauria, Jan Elffers, Jakob Nordström
CNFgen: A Generator of Crafted Benchmarks. 464-473
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-11-22 19:31 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: