default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID18th SAT 2015: Austin, TX, USA
- Marijn Heule, Sean A. Weaver:
Theory and Applications of Satisfiability Testing - SAT 2015 - 18th International Conference, Austin, TX, USA, September 24-27, 2015, Proceedings. Lecture Notes in Computer Science 9340, Springer 2015, ISBN 978-3-319-24317-7 - Shaowei Cai
, Chuan Luo, Kaile Su:
CCAnr: A Configuration Checking Based Local Search Solver for Non-random Satisfiability. 1-8 - Tobias Philipp, Peter Steinke:
PBLib - A Library for Encoding Pseudo-Boolean Constraints into CNF. 9-16 - Valeriy Balabanov, Alexander Ivrii:
Speeding up MUS Extraction with Preprocessing and Chunking. 17-32 - Ruiwen Chen, Rahul Santhanam:
Improved Algorithms for Sparse MAX-SAT and MAX-k-CSP. 33-45 - Jan Burchard, Tobias Schubert, Bernd Becker:
Laissez-Faire Caching for Parallel #SAT Solving. 46-61 - Zack Newsham, William Lindsay, Vijay Ganesh, Jia Hui Liang, Sebastian Fischmeister, Krzysztof Czarnecki:
SATGraf: Visualizing the Evolution of SAT Formula Structure in Solvers. 62-70 - Jonathan Kalechstain, Vadim Ryvchin, Nachum Dershowitz:
Hints Revealed. 71-87 - Alexander Ivrii, Vadim Ryvchin, Ofer Strichman:
Mining Backbone Literals in Incremental SAT - A New Kind of Incremental Data. 88-103 - Adam Douglass, Andrew D. King, Jack Raymond:
Constructing SAT Filters with a Quantum Annealer. 104-120 - Rehan Abdul Aziz, Geoffrey Chu, Christian J. Muise, Peter J. Stuckey:
#∃SAT: Projected Model Counting. 121-137 - Oliver Kullmann, João Marques-Silva:
Computing Maximal Autarkies with Few and Simple Oracle Queries. 138-155 - Tomás Balyo, Peter Sanders, Carsten Sinz:
HordeSat: A Massively Parallel Portfolio SAT Solver. 156-172 - Ralf Wimmer, Karina Gitina, Jennifer Nist, Christoph Scholl, Bernd Becker:
Preprocessing for DQBF. 173-190 - Florian Lonsing, Uwe Egly:
Incrementally Computing Minimal Unsatisfiable Cores of QBFs via a Clause Group Solver API. 191-198 - Simone Bova, Florent Capelli, Stefan Mengel, Friedrich Slivovsky:
On Compiling CNFs into Structured Deterministic DNNFs. 199-214 - Stefan Falkner, Marius Lindauer, Frank Hutter:
SpySMAC: Automated Configuration and Performance Analysis of SAT Solvers. 215-222 - Robert Ganian, Stefan Szeider:
Community Structure Inspired Algorithms for SAT and #SAT. 223-237 - Carlos Ansótegui, Jesús Giráldez-Cru, Jordi Levy, Laurent Simon:
Using Community Structure to Detect Relevant Learnt Clauses. 238-254 - Markus Iser, Norbert Manthey, Carsten Sinz:
Recognition of Nested Gates in CNF Formulas. 255-271 - Miguel Neves, Ruben Martins, Mikolás Janota, Inês Lynce, Vasco Manquinho:
Exploiting Resolution-Based Representations for MaxSAT Solving. 272-286 - Alexey Ignatiev, Alessandro Previti, João Marques-Silva:
SAT-Based Formula Simplification. 287-298 - Ravi Mangal, Xin Zhang, Aditya V. Nori, Mayur Naik:
Volt: A Lazy Grounding Framework for Solving Very Large MaxSAT Instances. 299-306 - Chanseok Oh:
Between SAT and UNSAT: The Fundamental Difference in CDCL SAT. 307-323 - M. Fareed Arif, Carlos Mencía, João Marques-Silva:
Efficient MUS Enumeration of Horn Formulae with Applications to Axiom Pinpointing. 324-342 - Kuan-Hua Tu, Tzu-Chien Hsu, Jie-Hong R. Jiang:
QELL: QBF Reasoning with Extended Clause Learning and Levelized SAT Solving. 343-359 - Florian Corzilius, Gereon Kremer, Sebastian Junges, Stefan Schupp, Erika Ábrahám:
SMT-RAT: An Open Source C++ Toolbox for Strategic and Parallel SMT Solving. 360-368 - Antti E. J. Hyvärinen, Matteo Marescotti, Natasha Sharygina:
Search-Space Partitioning for Parallelizing SMT Solvers. 369-386 - Christian Zielke, Michael Kaufmann:
A New Approach to Partial MUS Enumeration. 387-404 - Armin Biere, Andreas Fröhlich:
Evaluating CDCL Variable Scoring Schemes. 405-422 - Carlos Mencía, Alessandro Previti, João Marques-Silva:
SAT-Based Horn Least Upper Bounds. 423-433
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-12-13 18:59 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:
