BibSLEIGH — Selected Revised Papers of the Sixth International Conference on Theory and Applications of Satisfiability Testing

Enrico Giunchiglia, Armando Tacchella
Selected Revised Papers of the Sixth International Conference on Theory and Applications of Satisfiability Testing
SAT, 2003.

TEST

@proceedings{SAT-2003,
	address       = "SAT 2003. Santa Margherita Ligure, Italy",
	editor        = "Enrico Giunchiglia and Armando Tacchella",
	isbn          = "3-540-20851-8",
	publisher     = "{Springer International Publishing}",
	series        = "{Lecture Notes in Computer Science}",
	title         = "{Selected Revised Papers of the Sixth International Conference on Theory and Applications of Satisfiability Testing}",
	volume        = 2919,
	year          = 2003,
}

Contents (38 items)

SAT-2003-DransfieldMT #satisfiability: Satisfiability and Computing van der Waerden Numbers (MRD, VWM, MT), pp. 1–13.
SAT-2003-Chen #algorithm #satisfiability: An Algorithm for SAT Above the Threshold (HC), pp. 14–24.
SAT-2003-GentGNRT #data type: Watched Data Structures for QBF Solvers (IPG, EG, MN, AGDR, AT), pp. 25–36.
SAT-2003-GoldbergN #how #question: How Good Can a Resolution Based SAT-solver Be? (EG, YN), pp. 37–52.
SAT-2003-LiSB #effectiveness #performance #satisfiability #using: A Local Search SAT Solver Using an Effective Switching Strategy and an Efficient Unit Propagation (XYL, MFMS, FB), pp. 53–68.
SAT-2003-HanataniHI: Density Condensation of Boolean Formulas (YH, TH, KI), pp. 69–77.
SAT-2003-ClarkeTVW #abstraction #hardware #satisfiability #verification: SAT Based Predicate Abstraction for Hardware Verification (EMC, MT, HV, DW), pp. 78–92.
SAT-2003-BuningSZ #modelling #on the #quantifier: On Boolean Models for Quantified Boolean Horn Formulas (HKB, KS, XZ), pp. 93–104.
SAT-2003-Prestwich #problem: Local Search on SAT-encoded Colouring Problems (SDP), pp. 105–119.
SAT-2003-SemerjianM #case study #physics #problem #random #satisfiability: A Study of Pure Random Walk on Random Satisfiability Problems with “Physical” Methods (GS, RM), pp. 120–134.
SAT-2003-MaarenN: Hidden Threshold Phenomena for Fixed-Density SAT-formulae (HvM, LvN), pp. 135–149.
SAT-2003-BaumerS #algorithm #independence #probability #satisfiability: Improving a Probabilistic 3-SAT Algorithm by Dynamic Search and Independent Clause Pairs (SB, RS), pp. 150–161.
SAT-2003-BroeringL #algorithm #satisfiability: Width-Based Algorithms for SAT and CIRCUIT-SAT: (EB, SVL), pp. 162–171.
SAT-2003-PorschenRS #algorithm #linear #problem #satisfiability: Linear Time Algorithms for Some Not-All-Equal Satisfiability Problems (SP, BR, ES), pp. 172–187.
SAT-2003-Szeider #on the #parametricity #satisfiability: On Fixed-Parameter Tractable Parameterizations of SAT (SS), pp. 188–202.
SAT-2003-Parisi #approach #on the #probability #problem #random #satisfiability: On the Probabilistic Approach to the Random Satisfiability Problem (GP), pp. 203–213.
SAT-2003-EglySTWZ #quantifier: Comparing Different Prenexing Strategies for Quantified Boolean Formulas (UE, MS, HT, SW, MZ), pp. 214–228.
SAT-2003-Bruni #fault #satisfiability #scalability #set: Solving Error Correction for Large Data Sets by Means of a SAT Solver (RB), pp. 229–241.
SAT-2003-SabharwalBK #learning #performance #problem #using: Using Problem Structure for Efficient Clause Learning (AS, PB, HAK), pp. 242–256.
SAT-2003-ArmandoC #analysis #protocol #satisfiability #security: Abstraction-Driven SAT-based Analysis of Security Protocols (AA, LC), pp. 257–271.
SAT-2003-KhurshidMSJ #performance: A Case for Efficient Solution Enumeration (SK, DM, IS, DJ), pp. 272–286.
SAT-2003-ZhangM #algorithm #case study #implementation #performance #satisfiability: Cache Performance of SAT Solvers: a Case Study for Efficient Implementation of Algorithms (LZ, SM), pp. 287–298.
SAT-2003-BessiereHW #consistency #satisfiability: Local Consistencies in SAT (CB, EH, TW), pp. 299–314.
SAT-2003-BjesseKDSZ #satisfiability: Guiding SAT Diagnosis with Tree Decompositions (PB, JHK, RFD, TS, YZ), pp. 315–329.
SAT-2003-Williams #on the: On Computing k-CNF Formula Properties (RW), pp. 330–340.
SAT-2003-BacchusW #effectiveness #preprocessor #reduction #similarity: Effective Preprocessing with Hyper-Resolution and Equality Reduction (FB, JW), pp. 341–355.
SAT-2003-BuningZ: Read-Once Unit Resolution (HKB, XZ), pp. 356–369.
SAT-2003-DrakeF #branch #heuristic #interactive: The Interaction Between Inference and Branching Heuristics (LD, AMF), pp. 370–382.
SAT-2003-Pretolani #problem #reduction #satisfiability: Hypergraph Reductions and Satisfiability Problems (DP), pp. 383–397.
SAT-2003-FrancoKSWWDV #named #satisfiability: SBSAT: a State-Based, BDD-Based Satisfiability Solver (JVF, MK, JSS, JW, SW, MD, WMV), pp. 398–410.
SAT-2003-MneimnehS #graph #scalability: Computing Vertex Eccentricity in Exponentially Large Graphs: QBF Formulation and Solution (MNM, KAS), pp. 411–425.
SAT-2003-Kullmann #combinator: The Combinatorics of Conflicts between Clauses (OK), pp. 426–440.
SAT-2003-HerbstrittB #branch: Conflict-Based Selection of Branching Rules (MH, BB), pp. 441–451.
SAT-2003-BerreS #contest #satisfiability: The Essentials of the SAT 2003 Competition (DLB, LS), pp. 452–467.
SAT-2003-BerreST #challenge #evaluation #satisfiability: Challenges in the QBF Arena: the SAT’03 Evaluation of QBF Solvers (DLB, LS, AT), pp. 468–485.
SAT-2003-DequenD #named #performance #random #satisfiability: kcnfs: An Efficient Solver for Random k-SAT Formulae (GD, OD), pp. 486–501.
SAT-2003-EenS: An Extensible SAT-solver (NE, NS), pp. 502–518.
SAT-2003-BraunsteinZ #overview #random #satisfiability: Survey and Belief Propagation on Random K-SAT (AB, RZ), pp. 519–528.

Enrico Giunchiglia, Armando TacchellaSelected Revised Papers of the Sixth International Conference on Theory and Applications of Satisfiability TestingSAT, 2003.

Contents (38 items)

Enrico Giunchiglia, Armando Tacchella
Selected Revised Papers of the Sixth International Conference on Theory and Applications of Satisfiability Testing
SAT, 2003.