default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID11th SAT 2008: Guangzhou, China
- Hans Kleine Büning, Xishun Zhao:
Theory and Applications of Satisfiability Testing - SAT 2008, 11th International Conference, SAT 2008, Guangzhou, China, May 12-15, 2008. Proceedings. Lecture Notes in Computer Science 4996, Springer 2008, ISBN 978-3-540-79718-0 - Josep Argelich
, Alba Cabiscol, Inês Lynce, Felip Manyà:
Modelling Max-CSP as Partial Max-SAT. 1-14 - Josep Argelich, Chu Min Li, Felip Manyà:
A Preprocessor for Max-SAT Solvers. 15-20 - Gilles Audemard, Lucas Bordeaux, Youssef Hamadi, Saïd Jabbour, Lakhdar Sais:
A Generalized Framework for Conflict Analysis. 21-27 - Armin Biere:
Adaptive Restart Strategies for Conflict Driven SAT Solvers. 28-33 - Nadia Creignou, Hervé Daudé, Uwe Egly, Raphaël Rossignol:
New Results on the Phase Transition for Random Quantified Boolean Formulas. 34-47 - John D. Davis, Zhangxi Tan, Fang Yu, Lintao Zhang:
Designing an Efficient Hardware Implication Accelerator for SAT Solving. 48-62 - Tobias Eibach, Enrico Pilz, Gunnar Völkel:
Attacking Bivium Using SAT Solvers. 63-76 - Germain Faure, Robert Nieuwenhuis, Albert Oliveras, Enric Rodríguez-Carbonell:
SAT Modulo the Theory of Linear Arithmetic: Exact, Inexact and Commercial Solvers. 77-90 - Yong Gao:
Random Instances of W[2]-Complete Problems: Thresholds, Complexity, and Algorithms. 91-104 - Konstantinos Georgiou, Periklis A. Papakonstantinou:
Complexity and Algorithms for Well-Structured k-SAT Instances. 105-118 - Eugene Goldberg:
A Decision-Making Procedure for Resolution-Based SAT-Solvers. 119-132 - Shai Haim, Toby Walsh:
Online Estimation of SAT Solving Runtime. 133-138 - Federico Heras, Javier Larrosa:
A Max-SAT Inference-Based Pre-processing for Max-Clique. 139-152 - Kazuo Iwama:
SAT, UNSAT and Coloring. 153 - Stephan Kottler, Michael Kaufmann, Carsten Sinz:
Computation of Renameable Horn Backdoors. 154-160 - Stephan Kottler, Michael Kaufmann, Carsten Sinz:
A New Bound for an NP-Hard Subclass of 3-SAT Using Backdoors. 161-167 - Florian Letombe, João Marques-Silva:
Improvements to Hybrid Incremental SAT Algorithms. 168-181 - Mark H. Liffiton, Karem A. Sakallah:
Searching for Autarkies to Trim Unsatisfiable Clause Sets. 182-195 - Florian Lonsing, Armin Biere:
Nenofex: Expanding NNF for QBF Solving. 196-210 - Maarten Mariën, Johan Wittocx, Marc Denecker, Maurice Bruynooghe:
SAT(ID): Satisfiability of Propositional Logic Extended with Inductive Definitions. 211-224 - João Marques-Silva, Vasco Manquinho:
Towards More Effective Unsatisfiability-Based Maximum Satisfiability Algorithms. 225-230 - Stefan Porschen, Ewald Speckenmeyer:
A CNF Class Generalizing Exact Linear Formulas. 231-245 - Dominik Scheder, Philipp Zumstein:
How Many Conflicts Does It Need to Be Unsatisfiable? 246-256 - Zbigniew Stachniak, Anton Belov:
Speeding-Up Non-clausal Local Search for Propositional Satisfiability with Clause Learning. 257-270 - Vadim Ryvchin, Ofer Strichman:
Local Restarts. 271-276 - Alasdair Urquhart:
Regular and General Resolution: An Improved Separation. 277-290 - Hans van Maaren, Siert Wieringa:
Finding Guaranteed MUSes Fast. 291-304
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 2026-02-13 22:36 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:
