default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID17th SAT 2014: Vienna, Austria
- Carsten Sinz, Uwe Egly:
Theory and Applications of Satisfiability Testing - SAT 2014 - 17th International Conference, Held as Part of the Vienna Summer of Logic, VSL 2014, Vienna, Austria, July 14-17, 2014. Proceedings. Lecture Notes in Computer Science 8561, Springer 2014, ISBN 978-3-319-09283-6
Invited Talk
- Jakob Nordström
:
A (Biased) Proof Complexity Survey for SAT Practitioners. 1-6
Technical Papers
- Fahiem Bacchus, Nina Narodytska:
Cores in Core Based MaxSat Algorithms: An Analysis. 7-15 - Sigve Hortemo Sæther, Jan Arne Telle, Martin Vatshelle:
Solving MaxSAT and #SAT on Structured CNF Formulas. 16-31 - Takayuki Sakai, Kazuhisa Seto, Suguru Tamaki:
Solving Sparse Instances of Max SAT via Width Reduction and Greedy Restriction. 32-47 - Anton Belov, Marijn Heule, João Marques-Silva:
MUS Extraction Using Clausal Proofs. 48-57 - João Marques-Silva, Alessandro Previti:
On Computing Preferred MUSes and MCSes. 58-74 - Matti Järvisalo, Janne H. Korhonen:
Conditional Lower Bounds for Failed Literals and Related Techniques. 75-84 - Ronald de Haan, Stefan Szeider:
Fixed-Parameter Tractable Reductions to SAT. 85-102 - Alexey Ignatiev, António Morgado, João Marques-Silva:
On Reducing Maximum Independent Set to Minimum Satisfiability. 103-120 - Mladen Miksa, Jakob Nordström:
Long Proofs of (Seemingly) Simple Formulas. 121-137 - Gabriel Istrate, Adrian Craciun:
Proof Complexity and the Kneser-Lovász Theorem. 138-153 - Valeriy Balabanov, Magdalena Widl, Jie-Hong R. Jiang:
QBF Resolution Systems and Their Proof Complexities. 154-169 - Olaf Beyersdorff, Oliver Kullmann:
Unified Characterisations of Resolution Hardness Measures. 170-187 - Tomohiro Sonobe, Shuya Kondoh, Mary Inaba:
Community Branching for Parallel Portfolio SAT Solvers. 188-196 - Gilles Audemard, Laurent Simon:
Lazy Clause Exchange Policy for Parallel SAT Solvers. 197-205 - Alexander Nadel, Vadim Ryvchin, Ofer Strichman:
Ultimately Incremental SAT. 206-218 - Boris Konev, Alexei Lisitsa:
A SAT Attack on the Erdős Discrepancy Conjecture. 219-226 - Tamir Heyman, Dan Smith, Yogesh Mahajan, Lance Leong, Husam Abu-Haimed:
Dominant Controllability Check Using QBF-Solver and Netlist Optimizer. 227-242 - Bernd Finkbeiner, Leander Tentrup:
Fast DQBF Refutation. 243-251 - Zack Newsham, Vijay Ganesh, Sebastian Fischmeister, Gilles Audemard, Laurent Simon:
Impact of Community Structure on SAT Solver Performance. 252-268 - Friedrich Slivovsky, Stefan Szeider:
Variable Dependencies and Q-Resolution. 269-284 - Armin Biere, Daniel Le Berre, Emmanuel Lonca, Norbert Manthey:
Detecting Cardinality Constraints in CNF. 285-301 - Adrian Balint, Armin Biere, Andreas Fröhlich, Uwe Schöning:
Improving Implementation of SLS Solvers for SAT and New Heuristics for k-SAT with Long Clauses. 302-316 - Tomás Balyo, Andreas Fröhlich, Marijn Heule, Armin Biere:
Everything You Always Wanted to Know about Blocked Sets (But Were Afraid to Ask). 317-332 - Daniel Larraz, Albert Oliveras, Enric Rodríguez-Carbonell, Albert Rubio:
Minimal-Model-Guided Approaches to Solving Polynomial Constraints and Extensions. 333-350 - Yoav Fekete, Michael Codish:
Simplifying Pseudo-Boolean Constraints in Residual Number Systems. 351-366 - Oliver Gableske:
An Ising Model Inspired Extension of the Product-Based MP Framework for SAT. 367-383 - Andrei A. Bulatov, Cong Wang:
Approximating Highly Satisfiable Random 2-SAT. 384-398 - Florent Capelli, Arnaud Durand, Stefan Mengel:
Hypergraph Acyclicity and Propositional Model Counting. 399-414
Tool Papers
- Carles Creus, Pau Fernández, Guillem Godoy:
Automatic Evaluation of Reductions between NP-Complete Problems. 415-421 - Nathan Wetzler, Marijn Heule, Warren A. Hunt Jr.:
DRAT-trim: Efficient Checking and Trimming Using Expressive Clausal Proofs. 422-429 - Charles Jordan, Lukasz Kaiser, Florian Lonsing, Martina Seidl:
MPIDepQBF: Towards Parallel QBF Solving without Knowledge Sharing. 430-437 - Ruben Martins, Vasco Manquinho, Inês Lynce:
Open-WBO: A Modular MaxSAT Solver, . 438-445
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-04 01:07 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:
