Proceedings of the 11th International Conference on Theory and Applications of Satisfiability Testing
BibSLEIGH corpus
BibSLEIGH tags
BibSLEIGH bundles
BibSLEIGH people
EDIT!
CC-BY
Open Knowledge
XHTML 1.0 W3C Rec
CSS 2.1 W3C CanRec
email twitter

Hans Kleine Büning, Xishun Zhao
Proceedings of the 11th International Conference on Theory and Applications of Satisfiability Testing
SAT, 2008.

TEST
DBLP
Scholar
Full names Links ISxN
@proceedings{SAT-2008,
	address       = "Guangzhou, China",
	editor        = "Hans Kleine Büning and Xishun Zhao",
	isbn          = "978-3-540-79718-0",
	publisher     = "{Springer International Publishing}",
	series        = "{Lecture Notes in Computer Science}",
	title         = "{Proceedings of the 11th International Conference on Theory and Applications of Satisfiability Testing}",
	volume        = 4996,
	year          = 2008,
}

Contents (27 items)

SAT-2008-ArgelichCLM #modelling #satisfiability
Modelling Max-CSP as Partial Max-SAT (JA, AC, IL, FM), pp. 1–14.
SAT-2008-ArgelichLM #preprocessor #satisfiability
A Preprocessor for Max-SAT Solvers (JA, CML, FM), pp. 15–20.
SAT-2008-AudemardBHJS #analysis #framework
A Generalized Framework for Conflict Analysis (GA, LB, YH, SJ, LS), pp. 21–27.
SAT-2008-Biere #adaptation #satisfiability
Adaptive Restart Strategies for Conflict Driven SAT Solvers (AB), pp. 28–33.
SAT-2008-CreignouDER #quantifier #random
New Results on the Phase Transition for Random Quantified Boolean Formulas (NC, HD, UE, RR), pp. 34–47.
SAT-2008-DavisTYZ #design #hardware #performance #satisfiability
Designing an Efficient Hardware Implication Accelerator for SAT Solving (JDD, ZT, FY, LZ), pp. 48–62.
SAT-2008-EibachPV #satisfiability #using
Attacking Bivium Using SAT Solvers (TE, EP, GV), pp. 63–76.
SAT-2008-FaureNOR #formal method #linear #satisfiability
SAT Modulo the Theory of Linear Arithmetic: Exact, Inexact and Commercial Solvers (GF, RN, AO, ERC), pp. 77–90.
SAT-2008-Gao #algorithm #complexity #problem #random
Random Instances of W[2]-Complete Problems: Thresholds, Complexity, and Algorithms (YG), pp. 91–104.
SAT-2008-GeorgiouP #algorithm #complexity #satisfiability
Complexity and Algorithms for Well-Structured k-SAT Instances (KG, PAP), pp. 105–118.
SAT-2008-Goldberg
A Decision-Making Procedure for Resolution-Based SAT-Solvers (EG), pp. 119–132.
SAT-2008-HaimW #estimation #online #runtime #satisfiability
Online Estimation of SAT Solving Runtime (SH, TW), pp. 133–138.
SAT-2008-HerasL #clique #preprocessor #satisfiability
A Max-SAT Inference-Based Pre-processing for Max-Clique (FH, JL), pp. 139–152.
SAT-2008-Iwama #satisfiability
SAT, UNSAT and Coloring (KI), p. 153.
SAT-2008-KottlerKS
Computation of Renameable Horn Backdoors (SK, MK, CS), pp. 154–160.
SAT-2008-KottlerKS08a #bound #np-hard #satisfiability #subclass #using
A New Bound for an NP-Hard Subclass of 3-SAT Using Backdoors (SK, MK, CS), pp. 161–167.
SAT-2008-LetombeM #algorithm #hybrid #incremental #satisfiability
Improvements to Hybrid Incremental SAT Algorithms (FL, JMS), pp. 168–181.
SAT-2008-LiffitonS #satisfiability #set
Searching for Autarkies to Trim Unsatisfiable Clause Sets (MHL, KAS), pp. 182–195.
SAT-2008-LonsingB #named
Nenofex: Expanding NNF for QBF Solving (FL, AB), pp. 196–210.
SAT-2008-MarienWDB #induction #logic #satisfiability
SAT(ID): Satisfiability of Propositional Logic Extended with Inductive Definitions (MM, JW, MD, MB), pp. 211–224.
SAT-2008-Marques-SilvaM #algorithm #effectiveness #satisfiability #towards
Towards More Effective Unsatisfiability-Based Maximum Satisfiability Algorithms (JMS, VMM), pp. 225–230.
SAT-2008-PorschenS #linear
A CNF Class Generalizing Exact Linear Formulas (SP, ES), pp. 231–245.
SAT-2008-SchederZ #how #question #satisfiability
How Many Conflicts Does It Need to Be Unsatisfiable? (DS, PZ), pp. 246–256.
SAT-2008-StachniakB #learning #satisfiability
Speeding-Up Non-clausal Local Search for Propositional Satisfiability with Clause Learning (ZS, AB), pp. 257–270.
SAT-2008-RyvchinS
Local Restarts (VR, OS), pp. 271–276.
SAT-2008-Urquhart
Regular and General Resolution: An Improved Separation (AU), pp. 277–290.
SAT-2008-MaarenW #performance
Finding Guaranteed MUSes Fast (HvM, SW), pp. 291–304.

Bibliography of Software Language Engineering in Generated Hypertext (BibSLEIGH) is created and maintained by Dr. Vadim Zaytsev.
Hosted as a part of SLEBOK on GitHub.