8. SAT 2005:
St. Andrews,
UK
Fahiem Bacchus, Toby Walsh (Eds.):
Theory and Applications of Satisfiability Testing, 8th International Conference, SAT 2005, St. Andrews, UK, June 19-23, 2005, Proceedings.
Lecture Notes in Computer Science 3569 Springer 2005, ISBN 3-540-26276-8 BibTeX
- Josep Argelich, Felip Manyà:
Solving Over-Constrained Problems with SAT Technology.
1-15
Electronic Edition (link) BibTeX
- Gilles Audemard, Lakhdar Sais:
A Symbolic Search Based Approach for Quantified Boolean Formulas.
16-30
Electronic Edition (link) BibTeX
- Anton Belov, Zbigniew Stachniak:
Substitutional Definition of Satisfiability in Classical Propositional Logic.
31-45
Electronic Edition (link) BibTeX
- Nachum Dershowitz, Ziyad Hanna, Alexander Nadel:
A Clause-Based Heuristic for SAT Solvers.
46-60
Electronic Edition (link) BibTeX
- Niklas Eén, Armin Biere:
Effective Preprocessing in SAT Through Variable and Clause Elimination.
61-75
Electronic Edition (link) BibTeX
- Nicola Galesi, Neil Thapen:
Resolution and Pebbling Games.
76-90
Electronic Edition (link) BibTeX
- Ian P. Gent, Andrew G. D. Rowley:
Local and Global Complete Solution Learning Methods for QBF.
91-106
Electronic Edition (link) BibTeX
- Eugene Goldberg:
Equivalence Checking of Circuits with Parameterized Specifications.
107-121
Electronic Edition (link) BibTeX
- Marijn Heule, Hans van Maaren:
Observed Lower Bounds for Random 3-SAT Phase Transition Density Using Linear Programming.
122-134
Electronic Edition (link) BibTeX
- Edward A. Hirsch, Sergey I. Nikolenko:
Simulating Cutting Plane Proofs with Restricted Degree of Falsity by Resolution.
135-142
Electronic Edition (link) BibTeX
- Michal Kouril, John V. Franco:
Resolution Tunnels for Improved SAT Solver Performance.
143-157
Electronic Edition (link) BibTeX
- Chu Min Li, Wen Qi Huang:
Diversification and Determinism in Local Search for Satisfiability.
158-172
Electronic Edition (link) BibTeX
- Mark H. Liffiton, Karem A. Sakallah:
On Finding All Minimally Unsatisfiable Subformulas.
173-186
Electronic Edition (link) BibTeX
- Darko Marinov, Sarfraz Khurshid, Suhabe Bugrara, Lintao Zhang, Martin C. Rinard:
Optimizations for Compiling Declarative Models into Boolean Formulas.
187-202
Electronic Edition (link) BibTeX
- Steven David Prestwich:
Random Walk with Continuously Smoothed Variable Weights.
203-215
Electronic Edition (link) BibTeX
- Daniel Rolf:
Derandomization of PPSZ for Unique- k-SAT.
216-225
Electronic Edition (link) BibTeX
- Tian Sang, Paul Beame, Henry A. Kautz:
Heuristics for Fast Exact Model Counting.
226-240
Electronic Edition (link) BibTeX
- Hossein M. Sheini, Karem A. Sakallah:
A Scalable Method for Solving Satisfiability of Integer Linear Arithmetic Logic.
241-256
Electronic Edition (link) BibTeX
- Carsten Sinz, Edda-Maria Dieringer:
DPvis - A Tool to Visualize the Structure of SAT Instances.
257-268
Electronic Edition (link) BibTeX
- Finnegan Southey:
Constraint Metrics for Local Search.
269-281
Electronic Edition (link) BibTeX
- Allen Van Gelder:
Input Distance and Lower Bounds for Propositional Resolution Proof Length.
282-293
Electronic Edition (link) BibTeX
- Hans van Maaren, Linda van Norden:
Sums of Squares, Satisfiability and Maximum Satisfiability.
294-308
Electronic Edition (link) BibTeX
- Magnus Wahlström:
Faster Exact Solving of SAT Formulae with a Low Number of Occurrences per Variable.
309-323
Electronic Edition (link) BibTeX
- Wei Wei, Bart Selman:
A New Approach to Model Counting.
324-339
Electronic Edition (link) BibTeX
- Emmanuel Zarpas:
Benchmarking SAT Solvers for Bounded Model Checking.
340-354
Electronic Edition (link) BibTeX
- Xishun Zhao, Hans Kleine Büning:
Model-Equivalent Reductions.
355-370
Electronic Edition (link) BibTeX
- Teresa Alsinet, Felip Manyà, Jordi Planes:
Improved Exact Solvers for Weighted Max-SAT.
371-377
Electronic Edition (link) BibTeX
- Marco Benedetti:
Quantifier Trees for QBFs.
378-385
Electronic Edition (link) BibTeX
- Uwe Bubeck, Hans Kleine Büning, Xishun Zhao:
Quantifier Rewriting and Equivalence Models for Quantified Horn Formulas.
386-392
Electronic Edition (link) BibTeX
- Sylvie Coste-Marquis, Daniel Le Berre, Florian Letombe:
A Branching Heuristics for Quantified Renamable Horn Formulas.
393-399
Electronic Edition (link) BibTeX
- Evgeny Dantsin, Alexander Wolpert:
An Improved Upper Bound for SAT.
400-407
Electronic Edition (link) BibTeX
- Nachum Dershowitz, Ziyad Hanna, Jacob Katz:
Bounded Model Checking with QBF.
408-414
Electronic Edition (link) BibTeX
- Vijay Durairaj, Priyank Kalla:
Variable Ordering for Efficient SAT Search by Analyzing Constraint-Variable Dependencies.
415-422
Electronic Edition (link) BibTeX
- Roman Gershman, Ofer Strichman:
Cost-Effective Hyper-Resolution for Preprocessing CNF Formulas.
423-429
Electronic Edition (link) BibTeX
- Alexander S. Kulikov:
Automated Generation of Simplification Rules for SAT and MAXSAT.
430-436
Electronic Edition (link) BibTeX
- Matthew D. T. Lewis, Tobias Schubert, Bernd Becker:
Speedup Techniques Utilized in Modern SAT Solvers.
437-443
Electronic Edition (link) BibTeX
- Andrew C. Ling, Deshanand P. Singh, Stephen Dean Brown:
FPGA Logic Synthesis Using Quantified Boolean Satisfiability.
444-450
Electronic Edition (link) BibTeX
- Vasco M. Manquinho, João P. Marques Silva:
On Applying Cutting Planes in DLL-Based Algorithms for Pseudo-Boolean Optimization.
451-458
Electronic Edition (link) BibTeX
- Andreas Meier, Volker Sorge:
A New Set of Algebraic Benchmark Problems for SAT Solvers.
459-466
Electronic Edition (link) BibTeX
- 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.
467-474
Electronic Edition (link) BibTeX
- Sakari Seitz, Mikko Alava, Pekka Orponen:
Threshold Behaviour of WalkSAT and Focused Metropolis Search on Random 3-Satisfiability.
475-481
Electronic Edition (link) BibTeX
- Lintao Zhang:
On Subsumption Removal and On-the-Fly CNF Simplification.
482-489
Electronic Edition (link) BibTeX
Copyright © Sat May 16 23:36:45 2009
by Michael Ley (ley@uni-trier.de)
