Pictures from Sun Yat-Sen University, Guangzhou, P.R. China

SAT 2008 - Eleventh International Conference on
Theory and Applications of Satisfiability Testing

May 12 - 15 2008, Guangzhou, P. R. China

Invited Speakers

Preliminary Program

Poster Presentations

Important Dates

Conference Location

Registration and Accommodation

Paper Submissions

Previous Conferences

Conference Slides

Kazuo Iwama
SAT, UNSAT, MAXSAT and Coloring

Alasdair Urquhart
Regular and General Resolution: An Improved Separation

Mark Liffiton and Karem Sakallah
Searching for Autarkies to Trim Unsatisfiable Clause Sets

Florian Letombe and Joao Marques-Silva
Improvements to Hybrid Incremental SAT Algorithms

Hans van Maaren and Siert Wieringa
Finding Guaranteed MUSes Fast

Konstantinos Georgiou and Periklis A. Papakonstantinou
Complexity and Algorithms for Well-Structured k-SAT Instances

G. Audemard, L. Bordeaux, Y. Hamadi, S. Jabbour, and L. Sais
A Generalized Framework for Conflict Analysis

Armin Biere
Adaptive Restart Strategies for Conflict Driven SAT Solvers

Nadia Creignou, Hervé Daudé, Uwe Egly, and Raphaël Rossignol
New Results on the Phase Transition for Random Quantified Boolean Formulas

Florian Lonsing and Armin Biere
Nenofex: Expanding NNF for QBF Solving

Stefan Porschen and Ewald Speckenmeyer
A CNF Class Generalizing Exact Linear Formulas

Joao Marques-Silva and Vasco Manquinho
Towards More Effective Unsatisfiability-Based Maximum Satisfiability Algorithms

Eugene Goldberg
A Decision-Making Procedure for Resolution-Based SAT-Solvers

Zbigniew Stachniak and Anton Belov
Speeding-Up Non-clausal Local Search for Propositional Satisfiability with Clause Learning

Germain Faure, Robert Nieuwenhuis, Albert Oliveras, and Enric Rodríguez-Carbonel
SAT Modulo the Theory of Linear Arithmetic: Exact, Inexact and Commercial Solvers

Maarten Mariën, Johan Wittocx, Marc Denecker, and Maurice Bruynooghe
SAT(ID): Satisfiability of Propositional Logic Extended with Inductive Definitions

Claudia Peschiera, Luca Pulina, and Armando Tacchella
Third QBF solvers competition (QBFEVAL'08)

Oliver Kullmann
The OKlibrary: A generative research platform for (generalised) SAT solving

Shai Haim and Toby Walsh
Online Estimation of SAT Solving Runtime

Dominik Scheder and Philipp Zumstein
How Many Conflicts Does It Need to Be Unsatisfiable?

Stephan Kottler, Michael Kaufmann, and Carsten Sinz
Computation of Renameable Horn Backdoors

Stephan Kottler, Michael Kaufmann, and Carsten Sinz
A New Bound for an NP-Hard Subclass of 3-SAT Using Backdoors

Last modified: June 16, 2008.