6. SAT 2003: Santa Margherita Ligure, Italy

• Michael R. Dransfield, V. Wiktor Marek, Miroslaw Truszczynski:
  Satisfiability and Computing van der Waerden Numbers. 1-13
  
• Hubie Chen:
  An Algorithm for SAT Above the Threshold. 14-24
  
• Ian P. Gent, Enrico Giunchiglia, Massimo Narizzano, Andrew G. D. Rowley, Armando Tacchella:
  Watched Data Structures for QBF Solvers. 25-36
  
• Eugene Goldberg, Yakov Novikov:
  How Good Can a Resolution Based SAT-solver Be? 37-52
  
• Xiao Yu Li, Matthias F. M. Stallmann, Franc Brglez:
  A Local Search SAT Solver Using an Effective Switching Strategy and an Efficient Unit Propagation. 53-68
  
• Youichi Hanatani, Takashi Horiyama, Kazuo Iwama:
  Density Condensation of Boolean Formulas. 69-77
  
• Edmund M. Clarke, Muralidhar Talupur, Helmut Veith, Dong Wang:
  SAT Based Predicate Abstraction for Hardware Verification. 78-92
  
• Hans Kleine Büning, K. Subramani, Xishun Zhao:
  On Boolean Models for Quantified Boolean Horn Formulas. 93-104
  
• Steven David Prestwich:
  Local Search on SAT-encoded Colouring Problems. 105-119
  
• Guilhem Semerjian, Rémi Monasson:
  A Study of Pure Random Walk on Random Satisfiability Problems with "Physical" Methods. 120-134
  
• Hans van Maaren, Linda van Norden:
  Hidden Threshold Phenomena for Fixed-Density SAT-formulae. 135-149
  
• Sven Baumer, Rainer Schuler:
  Improving a Probabilistic 3-SAT Algorithm by Dynamic Search and Independent Clause Pairs. 150-161
  
• Elizabeth Broering, Satyanarayana V. Lokam:
  Width-Based Algorithms for SAT and CIRCUIT-SAT: (Extended Abstract). 162-171
  
• Stefan Porschen, Bert Randerath, Ewald Speckenmeyer:
  Linear Time Algorithms for Some Not-All-Equal Satisfiability Problems. 172-187
  
• Stefan Szeider:
  On Fixed-Parameter Tractable Parameterizations of SAT. 188-202
  
• Giorgio Parisi:
  On the Probabilistic Approach to the Random Satisfiability Problem. 203-213
  
• Uwe Egly, Martina Seidl, Hans Tompits, Stefan Woltran, Michael Zolda:
  Comparing Different Prenexing Strategies for Quantified Boolean Formulas. 214-228
  
• Renato Bruni:
  Solving Error Correction for Large Data Sets by Means of a SAT Solver. 229-241
  
• Ashish Sabharwal, Paul Beame, Henry A. Kautz:
  Using Problem Structure for Efficient Clause Learning. 242-256
  
• Alessandro Armando, Luca Compagna:
  Abstraction-Driven SAT-based Analysis of Security Protocols. 257-271
  
• Sarfraz Khurshid, Darko Marinov, Ilya Shlyakhter, Daniel Jackson:
  A Case for Efficient Solution Enumeration. 272-286
  
• Lintao Zhang, Sharad Malik:
  Cache Performance of SAT Solvers: a Case Study for Efficient Implementation of Algorithms. 287-298
  
• Christian Bessière, Emmanuel Hebrard, Toby Walsh:
  Local Consistencies in SAT. 299-314
  
• Per Bjesse, James H. Kukula, Robert F. Damiano, Ted Stanion, Yunshan Zhu:
  Guiding SAT Diagnosis with Tree Decompositions. 315-329
  
• Ryan Williams:
  On Computing k-CNF Formula Properties. 330-340
  
• Fahiem Bacchus, Jonathan Winter:
  Effective Preprocessing with Hyper-Resolution and Equality Reduction. 341-355
  
• Hans Kleine Büning, Xishun Zhao:
  Read-Once Unit Resolution. 356-369
  
• Lyndon Drake, Alan M. Frisch:
  The Interaction Between Inference and Branching Heuristics. 370-382
  
• Daniele Pretolani:
  Hypergraph Reductions and Satisfiability Problems. 383-397
  
• John V. Franco, Michal Kouril, John S. Schlipf, Jeffrey Ward, Sean Weaver, Michael Dransfield, W. Mark Vanfleet:
  SBSAT: a State-Based, BDD-Based Satisfiability Solver. 398-410
  
• Maher N. Mneimneh, Karem A. Sakallah:
  Computing Vertex Eccentricity in Exponentially Large Graphs: QBF Formulation and Solution. 411-425
  
• Oliver Kullmann:
  The Combinatorics of Conflicts between Clauses. 426-440
  
• Marc Herbstritt, Bernd Becker:
  Conflict-Based Selection of Branching Rules. 441-451
  
• Daniel Le Berre, Laurent Simon:
  The Essentials of the SAT 2003 Competition. 452-467
  
• Daniel Le Berre, Laurent Simon, Armando Tacchella:
  Challenges in the QBF Arena: the SAT'03 Evaluation of QBF Solvers. 468-485
  
• Gilles Dequen, Olivier Dubois:
  kcnfs: An Efficient Solver for Random k-SAT Formulae. 486-501
  
• Niklas Eén, Niklas Sörensson:
  An Extensible SAT-solver. 502-518
  
• Alfredo Braunstein, Riccardo Zecchina:
  Survey and Belief Propagation on Random K-SAT. 519-528
  

Last update Sun May 19 23:32:11 2013 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page