SAT A

38 papers

YearTitle / Authors
2010A Non-prenex, Non-clausal QBF Solver with Game-State Learning.
William Klieber, Samir Sapra, Sicun Gao, Edmund M. Clarke
2010A System for Solving Constraint Satisfaction Problems with SMT.
Miquel Bofill, Josep Suy, Mateu Villaret
2010An Empirical Study of Optimal Noise and Runtime Distributions in Local Search.
Lukas Kroc, Ashish Sabharwal, Bart Selman
2010An Exact Algorithm for the Boolean Connectivity Problem for
Kazuhisa Makino, Suguru Tamaki, Masaki Yamamoto
2010Assignment Stack Shrinking.
Alexander Nadel, Vadim Ryvchin
2010Automated Testing and Debugging of SAT and QBF Solvers.
Robert Brummayer, Florian Lonsing, Armin Biere
2010Bounds on Threshold of Regular Random
Vishwambhar Rathi, Erik Aurell, Lars K. Rasmussen, Mikael Skoglund
2010Complexity Results for Linear XSAT-Problems.
Stefan Porschen, Tatjana Schmidt, Ewald Speckenmeyer
2010Dynamic Scoring Functions with Variable Expressions: New SLS Methods for Solving SAT.
Dave A. D. Tompkins, Holger H. Hoos
2010Encoding Techniques, Craig Interpolants and Bounded Model Checking for Incomplete Designs.
Christian Miller, Stefan Kupferschmid, Matthew Lewis, Bernd Becker
2010Exact Algorithms and Complexity.
Ramamohan Paturi
2010Exact MinSAT Solving.
Chu Min Li, Felip Manyà, Zhe Quan, Zhu Zhu
2010Exploiting Circuit Representations in QBF Solving.
Alexandra Goultiaeva, Fahiem Bacchus
2010Green-Tao Numbers and SAT.
Oliver Kullmann
2010Improved Local Search for Circuit Satisfiability.
Anton Belov, Zbigniew Stachniak
2010Improving Stochastic Local Search for SAT with a New Probability Distribution.
Adrian Balint, Andreas Fröhlich
2010Improving Unsatisfiability-Based Algorithms for Boolean Optimization.
Vasco Manquinho, Ruben Martins, Inês Lynce
2010Integrating Dependency Schemes in Search-Based QBF Solvers.
Florian Lonsing, Armin Biere
2010Lower Bounds for Width-Restricted Clause Learning on Small Width Formulas.
Eli Ben-Sasson, Jan Johannsen
2010Minimising Deterministic Büchi Automata Precisely Using SAT Solving.
Rüdiger Ehlers
2010Non Uniform Selection of Solutions for Upper Bounding the 3-SAT Threshold.
Yacine Boufkhad, Thomas Hugel
2010On Moderately Exponential Time for SAT.
Evgeny Dantsin, Alexander Wolpert
2010On the Relative Merits of Simple Local Search Methods for the MAX-SAT Problem.
Denis Pankratov, Allan Borodin
2010Proof Complexity of Propositional Default Logic.
Olaf Beyersdorff, Arne Meier, Sebastian Müller, Michael Thomas, Heribert Vollmer
2010Reconstructing Solutions after Blocked Clause Elimination.
Matti Järvisalo, Armin Biere
2010Rewriting (Dependency-)Quantified 2-CNF with Arbitrary Free Literals into Existential 2-HORN.
Uwe Bubeck, Hans Kleine Büning
2010SAT Solving with Reference Points.
Stephan Kottler
2010Simple but Hard Mixed Horn Formulas.
Gayathri Namasivayam, Miroslaw Truszczynski
2010Statistical Methodology for Comparison of SAT Solvers.
Mladen Nikolic
2010Symmetry and Satisfiability: An Update.
Hadi Katebi, Karem A. Sakallah, Igor L. Markov
2010Synthesizing Shortest Linear Straight-Line Programs over GF(2) Using SAT.
Carsten Fuhs, Peter Schneider-Kamp
2010The Big Deal: Applying Constraint Satisfaction Technologies Where It Makes the Difference.
Yehuda Naveh
2010The Seventh QBF Solvers Evaluation (QBFEVAL'10).
Claudia Peschiera, Luca Pulina, Armando Tacchella, Uwe Bubeck, Oliver Kullmann, Inês Lynce
2010Theory and Applications of Satisfiability Testing - SAT 2010, 13th International Conference, SAT 2010, Edinburgh, UK, July 11-14, 2010. Proceedings
Ofer Strichman, Stefan Szeider
2010Two Techniques for Minimizing Resolution Proofs.
Scott Cotton
2010Uniquely Satisfiable
William Matthews, Ramamohan Paturi
2010Zero-One Designs Produce Small Hard SAT Instances.
Allen Van Gelder, Ivor T. A. Spence
2010sQueezeBF: An Effective Preprocessor for QBFs Based on Equivalence Reasoning.
Enrico Giunchiglia, Paolo Marin, Massimo Narizzano