SAT A

43 papers

YearTitle / Authors
2005A Branch-and-Bound Algorithm for Extracting Smallest Minimal Unsatisfiable Formulas.
Maher N. Mneimneh, Inês Lynce, Zaher S. Andraus, João Marques-Silva, Karem A. Sakallah
2005A Branching Heuristics for Quantified Renamable Horn Formulas.
Sylvie Coste-Marquis, Daniel Le Berre, Florian Letombe
2005A Clause-Based Heuristic for SAT Solvers.
Nachum Dershowitz, Ziyad Hanna, Alexander Nadel
2005A New Approach to Model Counting.
Wei Wei, Bart Selman
2005A New Set of Algebraic Benchmark Problems for SAT Solvers.
Andreas Meier, Volker Sorge
2005A Scalable Method for Solving Satisfiability of Integer Linear Arithmetic Logic.
Hossein M. Sheini, Karem A. Sakallah
2005A Symbolic Search Based Approach for Quantified Boolean Formulas.
Gilles Audemard, Lakhdar Sais
2005An Improved Upper Bound for SAT.
Evgeny Dantsin, Alexander Wolpert
2005Automated Generation of Simplification Rules for SAT and MAXSAT.
Alexander S. Kulikov
2005Benchmarking SAT Solvers for Bounded Model Checking.
Emmanuel Zarpas
2005Bounded Model Checking with QBF.
Nachum Dershowitz, Ziyad Hanna, Jacob Katz
2005Constraint Metrics for Local Search.
Finnegan Southey
2005Cost-Effective Hyper-Resolution for Preprocessing CNF Formulas.
Roman Gershman, Ofer Strichman
2005DPvis - A Tool to Visualize the Structure of SAT Instances.
Carsten Sinz, Edda-Maria Dieringer
2005Derandomization of PPSZ for Unique-
Daniel Rolf
2005Diversification and Determinism in Local Search for Satisfiability.
Chu Min Li, Wen Qi Huang
2005Effective Preprocessing in SAT Through Variable and Clause Elimination.
Niklas Eén, Armin Biere
2005Equivalence Checking of Circuits with Parameterized Specifications.
Eugene Goldberg
2005FPGA Logic Synthesis Using Quantified Boolean Satisfiability.
Andrew C. Ling, Deshanand P. Singh, Stephen Dean Brown
2005Faster Exact Solving of SAT Formulae with a Low Number of Occurrences per Variable.
Magnus Wahlström
2005Heuristics for Fast Exact Model Counting.
Tian Sang, Paul Beame, Henry A. Kautz
2005Improved Exact Solvers for Weighted Max-SAT.
Teresa Alsinet, Felip Manyà, Jordi Planes
2005Input Distance and Lower Bounds for Propositional Resolution Proof Length.
Allen Van Gelder
2005Local and Global Complete Solution Learning Methods for QBF.
Ian P. Gent, Andrew G. D. Rowley
2005Model-Equivalent Reductions.
Xishun Zhao, Hans Kleine Büning
2005Observed Lower Bounds for Random 3-SAT Phase Transition Density Using Linear Programming.
Marijn Heule, Hans van Maaren
2005On Applying Cutting Planes in DLL-Based Algorithms for Pseudo-Boolean Optimization.
Vasco Manquinho, João Marques-Silva
2005On Finding All Minimally Unsatisfiable Subformulas.
Mark H. Liffiton, Karem A. Sakallah
2005On Subsumption Removal and On-the-Fly CNF Simplification.
Lintao Zhang
2005Optimizations for Compiling Declarative Models into Boolean Formulas.
Darko Marinov, Sarfraz Khurshid, Suhabe Bugrara, Lintao Zhang, Martin C. Rinard
2005Quantifier Rewriting and Equivalence Models for Quantified Horn Formulas.
Uwe Bubeck, Hans Kleine Büning, Xishun Zhao
2005Quantifier Trees for QBFs.
Marco Benedetti
2005Random Walk with Continuously Smoothed Variable Weights.
Steven D. Prestwich
2005Resolution Tunnels for Improved SAT Solver Performance.
Michal Kouril, John V. Franco
2005Resolution and Pebbling Games.
Nicola Galesi, Neil Thapen
2005Simulating Cutting Plane Proofs with Restricted Degree of Falsity by Resolution.
Edward A. Hirsch, Sergey I. Nikolenko
2005Solving Over-Constrained Problems with SAT Technology.
Josep Argelich, Felip Manyà
2005Speedup Techniques Utilized in Modern SAT Solvers.
Matthew D. T. Lewis, Tobias Schubert, Bernd Becker
2005Substitutional Definition of Satisfiability in Classical Propositional Logic.
Anton Belov, Zbigniew Stachniak
2005Sums of Squares, Satisfiability and Maximum Satisfiability.
Hans van Maaren, Linda van Norden
2005Theory and Applications of Satisfiability Testing, 8th International Conference, SAT 2005, St. Andrews, UK, June 19-23, 2005, Proceedings
Fahiem Bacchus, Toby Walsh
2005Threshold Behaviour of WalkSAT and Focused Metropolis Search on Random 3-Satisfiability.
Sakari Seitz, Mikko Alava, Pekka Orponen
2005Variable Ordering for Efficient SAT Search by Analyzing Constraint-Variable Dependencies.
Vijay Durairaj, Priyank Kalla