SAT A

55 papers

YearTitle / Authors
2012A Cardinality Solver: More Expressive Constraints for Free - (Poster Presentation).
Mark H. Liffiton, Jordyn C. Maglalang
2012An Efficient Method for Solving UNSAT 3-SAT and Similar Instances via Static Decomposition - (Poster Presentation).
Emir Demirovic, Haris Gavranovic
2012An Improved Separation of Regular Resolution from Pool Resolution and Clause Learning.
Maria Luisa Bonet, Samuel R. Buss
2012Augmenting Clause Learning with Implied Literals - (Poster Presentation).
Arie Matsliah, Ashish Sabharwal, Horst Samulowitz
2012Azucar: A SAT-Based CSP Solver Using Compact Order Encoding - (Tool Presentation).
Tomoya Tanjo, Naoyuki Tamura, Mutsunori Banbara
2012Choosing Probability Distributions for Stochastic Local Search and the Role of Make versus Break.
Adrian Balint, Uwe Schöning
2012CoPAn: Exploring Recurring Patterns in Conflict Analysis of CDCL SAT Solvers - (Tool Presentation).
Stephan Kottler, Christian Zielke, Paul Seitz, Michael Kaufmann
2012Computing Resolution-Path Dependencies in Linear Time , .
Friedrich Slivovsky, Stefan Szeider
2012Concurrent Cube-and-Conquer - (Poster Presentation).
Peter van der Tak, Marijn Heule, Armin Biere
2012Conflict-Driven XOR-Clause Learning.
Tero Laitinen, Tommi A. Junttila, Ilkka Niemelä
2012Coprocessor 2.0 - A Flexible CNF Simplifier - (Tool Presentation).
Norbert Manthey
2012Creating Industrial-Like SAT Instances by Clustering and Reconstruction - (Poster Presentation).
Sebastian Burg, Stephan Kottler, Michael Kaufmann
2012Designing Scalable Parallel SAT Solvers.
Antti Eero Johannes Hyvärinen, Norbert Manthey
2012Efficient SAT Solving under Assumptions.
Alexander Nadel, Vadim Ryvchin
2012Evaluating Component Solver Contributions to Portfolio-Based Algorithm Selectors.
Lin Xu, Frank Hutter, Holger H. Hoos, Kevin Leyton-Brown
2012Exploiting Historical Relationships of Clauses and Variables in Local Search for Satisfiability - (Poster Presentation).
Chu Min Li, Wanxia Wei, Yu Li
2012Exponential Lower Bounds for DPLL Algorithms on Satisfiable Random 3-CNF Formulas.
Dimitris Achlioptas, Ricardo Menchaca-Méndez
2012Extended Failed-Literal Preprocessing for Quantified Boolean Formulas.
Allen Van Gelder, Samuel B. Wood, Florian Lonsing
2012Faulty Interaction Identification via Constraint Solving and Optimization.
Jian Zhang, Feifei Ma, Zhiqiang Zhang
2012Finding Efficient Circuits for Ensemble Computation.
Matti Järvisalo, Petteri Kaski, Mikko Koivisto, Janne H. Korhonen
2012Fixed-Parameter Tractability of Satisfying beyond the Number of Variables.
Robert Crowston, Gregory Z. Gutin, Mark Jones, Venkatesh Raman, Saket Saurabh, Anders Yeo
2012Generalized Property Directed Reachability.
Krystof Hoder, Nikolaj S. Bjørner
2012Henkin Quantifiers and Boolean Formulae.
Valeriy Balabanov, Hui-Ju Katherine Chiang, Jie-Hong Roland Jiang
2012Improved Single Pass Algorithms for Resolution Proof Reduction - (Poster Presentation).
Ashutosh Gupta
2012Improvements to Core-Guided Binary Search for MaxSAT.
António Morgado, Federico Heras, João Marques-Silva
2012Incremental QBF Preprocessing for Partial Design Verification - (Poster Presentation).
Paolo Marin, Christian Miller, Bernd Becker
2012Intensification Search in Modern SAT Solvers - (Poster Presentation).
Saïd Jabbour, Jerry Lonlac, Lakhdar Saïs
2012Interpolant Strength Revisited.
Georg Weissenbacher
2012Learning Back-Clauses in SAT - (Poster Presentation).
Ashish Sabharwal, Horst Samulowitz, Meinolf Sellmann
2012Learning Polynomials over GF(2) in a SAT Solver - (Poster Presentation).
George Katsirelos, Laurent Simon
2012Lynx: A Programmatic SAT Solver for the RNA-Folding Problem.
Vijay Ganesh, Charles W. O'Donnell, Mate Soos, Srinivas Devadas, Martin C. Rinard, Armando Solar-Lezama
2012Off the Trail: Re-examining the CDCL Algorithm.
Alexandra Goultiaeva, Fahiem Bacchus
2012On Davis-Putnam Reductions for Minimally Unsatisfiable Clause-Sets.
Oliver Kullmann, Xishun Zhao
2012On Efficient Computation of Variable MUSes.
Anton Belov, Alexander Ivrii, Arie Matsliah, João Marques-Silva
2012On Sequent Systems and Resolution for QBFs.
Uwe Egly
2012Optimizing MiniSAT Variable Orderings for the Relational Model Finder Kodkod - (Poster Presentation).
Ashlin Iser, Mana Taghdiri, Carsten Sinz
2012Parameterized Complexity of Weighted Satisfiability Problems.
Nadia Creignou, Heribert Vollmer
2012Perfect Hashing and CNF Encodings of Cardinality Constraints.
Yael Ben-Haim, Alexander Ivrii, Oded Margalit, Arie Matsliah
2012Preprocessing in Incremental SAT.
Alexander Nadel, Vadim Ryvchin, Ofer Strichman
2012Resolution-Based Certificate Extraction for QBF - (Tool Presentation).
Aina Niemetz, Mathias Preiner, Florian Lonsing, Martina Seidl, Armin Biere
2012Revisiting Clause Exchange in Parallel SAT Solving.
Gilles Audemard, Benoît Hoessen, Saïd Jabbour, Jean-Marie Lagniez, Cédric Piette
2012SATLab: X-Raying Random k-SAT - (Tool Presentation).
Thomas Hugel
2012SMT-Aided Combinatorial Materials Discovery.
Stefano Ermon, Ronan LeBras, Carla P. Gomes, Bart Selman, R. Bruce van Dover
2012SMT-RAT: An SMT-Compliant Nonlinear Real Arithmetic Toolbox - (Tool Presentation).
Florian Corzilius, Ulrich Loup, Sebastian Junges, Erika Ábrahám
2012SatX10: A Scalable Plug&Play Parallel SAT Framework - (Tool Presentation).
Bard Bloom, David Grove, Benjamin Herta, Ashish Sabharwal, Horst Samulowitz, Vijay A. Saraswat
2012Satisfiability and The Art of Computer Programming.
Donald E. Knuth
2012Satisfying versus Falsifying in Local Search for Satisfiability - (Poster Presentation).
Chu Min Li, Yu Li
2012Single-Solver Algorithms for 2QBF - (Poster Presentation).
Sam Bayless, Alan J. Hu
2012Solving QBF with Counterexample Guided Refinement.
Mikolás Janota, William Klieber, João Marques-Silva, Edmund M. Clarke
2012Strong Backdoors to Nested Satisfiability.
Serge Gaspers, Stefan Szeider
2012The Community Structure of SAT Formulas.
Carlos Ansótegui, Jesús Giráldez-Cru, Jordi Levy
2012Theory and Applications of Satisfiability Testing - SAT 2012 - 15th International Conference, Trento, Italy, June 17-20, 2012. Proceedings
Alessandro Cimatti, Roberto Sebastiani
2012Towards Massively Parallel Local Search for SAT - (Poster Presentation).
Alejandro Arbelaez, Philippe Codognet
2012Understanding IC3.
Aaron R. Bradley
2012Using Term Rewriting to Solve Bit-Vector Arithmetic Problems - (Poster Presentation).
Iago Abal, Alcino Cunha, Joe Hurd, Jorge Sousa Pinto