default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID16th SAT 2013: Helsinki, Finland
- Matti Järvisalo
, Allen Van Gelder:
Theory and Applications of Satisfiability Testing - SAT 2013 - 16th International Conference, Helsinki, Finland, July 8-12, 2013. Proceedings. Lecture Notes in Computer Science 7962, Springer 2013, ISBN 978-3-642-39070-8
Invited Talks
- Albert Atserias:
The Proof-Search Problem between Bounded-Width Resolution and Bounded-Degree Semi-algebraic Proofs. 1-17 - Edmund M. Clarke:
Turing's Computable Real Numbers and Why They Are Still Important Today. 18 - Peter J. Stuckey:
There Are No CNF Problems. 19-21
Best Paper
- Norbert Manthey, Tobias Philipp, Christoph Wernhard:
Soundness of Inprocessing in Clause Sharing SAT Solvers. 22-39
Technical Papers
- Jan Johannsen:
Exponential Separations in a Hierarchy of Clause Learning Proof Systems. 40-51 - Jacobo Torán:
On the Resolution Complexity of Graph Non-isomorphism. 52-66 - Mikolás Janota, João Marques-Silva:
On Propositional QBF Expansions and Q-Resolution. 67-82 - Alexandra Goultiaeva, Fahiem Bacchus:
Recovering and Utilizing Partial Duality in QBF. 83-99 - Florian Lonsing, Uwe Egly, Allen Van Gelder:
Efficient Clause Learning for Quantified Boolean Formulas via QBF Pseudo Unit Propagation. 100-115 - Siert Wieringa, Keijo Heljanko:
Concurrent Clause Strengthening. 116-132 - Anton Belov, Norbert Manthey, João Marques-Silva:
Parallel MUS Extraction. 133-149 - Alessandro Cimatti, Alberto Griggio, Bastiaan Joost Schaafsma, Roberto Sebastiani:
A Modular Approach to MaxSAT Modulo Theories. 150-165 - Jessica Davies, Fahiem Bacchus:
Exploiting the Power of mip Solvers in maxsat. 166-181 - Ruben Martins, Vasco Manquinho, Inês Lynce:
Community-Based Partitioning for MaxSAT Solving. 182-191 - Charles Jordan, Lukasz Kaiser:
Experiments with Reduction Finding. 192-207 - Andrew Mihal, Steve Teig:
A Constraint Satisfaction Approach for Programmable Logic Detailed Placement. 208-223 - Markus Iser, Carsten Sinz, Mana Taghdiri:
Minimizing Models for Tseitin-Encoded SAT Instances. 224-232 - Marcelo Finger, Ronan LeBras, Carla P. Gomes, Bart Selman:
Solutions for Hard and Soft Constraints Using Optimized Probabilistic Satisfiability. 233-249 - Alexey Ignatiev, Mikolás Janota, João Marques-Silva:
Quantified Maximum Satisfiability: - A Core-Guided Approach. 250-266 - Uwe Bubeck, Hans Kleine Büning:
Nested Boolean Functions as Models for Quantified Boolean Formulas. 267-275 - Jean-Marie Lagniez, Armin Biere:
Factoring Out Assumptions to Speed Up MUS Extraction. 276-292 - Oliver Gableske:
On the Interpolation between Product-Based Message Passing Heuristics for SAT. 293-308 - Gilles Audemard, Jean-Marie Lagniez, Laurent Simon:
Improving Glucose for Incremental SAT Solving with Assumptions: Application to MUS Extraction. 309-317 - Marijn Heule, Stefan Szeider:
A SAT Approach to Clique-Width. 318-334 - Igor Razgon, Justyna Petke:
Cliquewidth and Knowledge Compilation. 335-350 - Massimo Lauria:
A Rank Lower Bound for Cutting Planes Proofs of Ramsey's Theorem. 351-364 - Olaf Beyersdorff:
The Complexity of Theorem Proving in Autoepistemic Logic. 365-376 - Ronald de Haan, Iyad A. Kanj, Stefan Szeider:
Local Backbones. 377-393 - Neeldhara Misra, Sebastian Ordyniak, Venkatesh Raman, Stefan Szeider:
Upper and Lower Bounds for Weak Backdoor Set Detection. 394-402 - Mordechai Ben-Ari:
LearnSAT: A SAT Solver for Education. 403-407 - Johannes Dellert, Christian Zielke, Michael Kaufmann:
MUStICCa: MUS Extraction with Interactive Choice of Candidates. 408-414 - Hiroshi Fujita, Miyuki Koshimura, Ryuzo Hasegawa:
SCSat: A Soft Constraint Guided SAT Solver. 415-421 - Horst Samulowitz, Chandra Reddy, Ashish Sabharwal, Meinolf Sellmann:
Snappy: A Simple Algorithm Portfolio. 422-428 - Takehide Soh, Naoyuki Tamura, Mutsunori Banbara:
Scarab: A Rapid Prototyping Tool for SAT-Based Constraint Programming Systems. 429-436
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 2025-01-10 18:41 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:
