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