Abstract is missing.
- Solving Over-Constrained Problems with SAT TechnologyJosep Argelich, Felip Manyà. 1-15 [doi]
- A Symbolic Search Based Approach for Quantified Boolean FormulasGilles Audemard, Lakhdar Sais. 16-30 [doi]
- Substitutional Definition of Satisfiability in Classical Propositional LogicAnton Belov, Zbigniew Stachniak. 31-45 [doi]
- A Clause-Based Heuristic for SAT SolversNachum Dershowitz, Ziyad Hanna, Alexander Nadel. 46-60 [doi]
- Effective Preprocessing in SAT Through Variable and Clause EliminationNiklas Eén, Armin Biere. 61-75 [doi]
- Resolution and Pebbling GamesNicola Galesi, Neil Thapen. 76-90 [doi]
- Local and Global Complete Solution Learning Methods for QBFIan P. Gent, Andrew G. D. Rowley. 91-106 [doi]
- Equivalence Checking of Circuits with Parameterized SpecificationsEugene Goldberg. 107-121 [doi]
- Observed Lower Bounds for Random 3-SAT Phase Transition Density Using Linear ProgrammingMarijn Heule, Hans van Maaren. 122-134 [doi]
- Simulating Cutting Plane Proofs with Restricted Degree of Falsity by ResolutionEdward A. Hirsch, Sergey I. Nikolenko. 135-142 [doi]
- Resolution Tunnels for Improved SAT Solver PerformanceMichal Kouril, John V. Franco. 143-157 [doi]
- Diversification and Determinism in Local Search for SatisfiabilityChu Min Li, Wen-Qi Huang. 158-172 [doi]
- On Finding All Minimally Unsatisfiable SubformulasMark H. Liffiton, Karem A. Sakallah. 173-186 [doi]
- Optimizations for Compiling Declarative Models into Boolean FormulasDarko Marinov, Sarfraz Khurshid, Suhabe Bugrara, Lintao Zhang, Martin C. Rinard. 187-202 [doi]
- Random Walk with Continuously Smoothed Variable WeightsSteven David Prestwich. 203-215 [doi]
- Derandomization of PPSZ for Unique- ::::k::::-SATDaniel Rolf. 216-225 [doi]
- Heuristics for Fast Exact Model CountingTian Sang, Paul Beame, Henry A. Kautz. 226-240 [doi]
- A Scalable Method for Solving Satisfiability of Integer Linear Arithmetic LogicHossein M. Sheini, Karem A. Sakallah. 241-256 [doi]
- DPvis - A Tool to Visualize the Structure of SAT InstancesCarsten Sinz, Edda-Maria Dieringer. 257-268 [doi]
- Constraint Metrics for Local SearchFinnegan Southey. 269-281 [doi]
- Input Distance and Lower Bounds for Propositional Resolution Proof LengthAllen Van Gelder. 282-293 [doi]
- Sums of Squares, Satisfiability and Maximum SatisfiabilityHans van Maaren, Linda van Norden. 294-308 [doi]
- Faster Exact Solving of SAT Formulae with a Low Number of Occurrences per VariableMagnus Wahlström. 309-323 [doi]
- A New Approach to Model CountingWei Wei, Bart Selman. 324-339 [doi]
- Benchmarking SAT Solvers for Bounded Model CheckingEmmanuel Zarpas. 340-354 [doi]
- Model-Equivalent ReductionsXishun Zhao, Hans Kleine Büning. 355-370 [doi]
- Improved Exact Solvers for Weighted Max-SATTeresa Alsinet, Felip Manyà, Jordi Planes. 371-377 [doi]
- Quantifier Trees for QBFsMarco Benedetti. 378-385 [doi]
- Quantifier Rewriting and Equivalence Models for Quantified Horn FormulasUwe Bubeck, Hans Kleine Büning, Xishun Zhao. 386-392 [doi]
- A Branching Heuristics for Quantified Renamable Horn FormulasSylvie Coste-Marquis, Daniel Le Berre, Florian Letombe. 393-399 [doi]
- An Improved Upper Bound for SATEvgeny Dantsin, Alexander Wolpert. 400-407 [doi]
- Bounded Model Checking with QBFNachum Dershowitz, Ziyad Hanna, Jacob Katz. 408-414 [doi]
- Variable Ordering for Efficient SAT Search by Analyzing Constraint-Variable DependenciesVijay Durairaj, Priyank Kalla. 415-422 [doi]
- Cost-Effective Hyper-Resolution for Preprocessing CNF FormulasRoman Gershman, Ofer Strichman. 423-429 [doi]
- Automated Generation of Simplification Rules for SAT and MAXSATAlexander S. Kulikov. 430-436 [doi]
- Speedup Techniques Utilized in Modern SAT SolversMatthew D. T. Lewis, Tobias Schubert, Bernd Becker. 437-443 [doi]
- FPGA Logic Synthesis Using Quantified Boolean SatisfiabilityAndrew C. Ling, Deshanand P. Singh, Stephen Dean Brown. 444-450 [doi]
- On Applying Cutting Planes in DLL-Based Algorithms for Pseudo-Boolean OptimizationVasco M. Manquinho, João P. Marques Silva. 451-458 [doi]
- A New Set of Algebraic Benchmark Problems for SAT SolversAndreas Meier, Volker Sorge. 459-466 [doi]
- A Branch-and-Bound Algorithm for Extracting Smallest Minimal Unsatisfiable FormulasMaher N. Mneimneh, Inês Lynce, Zaher S. Andraus, João P. Marques Silva, Karem A. Sakallah. 467-474 [doi]
- Threshold Behaviour of WalkSAT and Focused Metropolis Search on Random 3-SatisfiabilitySakari Seitz, Mikko Alava, Pekka Orponen. 475-481 [doi]
- On Subsumption Removal and On-the-Fly CNF SimplificationLintao Zhang. 482-489 [doi]