Journal on Satisfiability, Boolean Modeling and Computation, Volume 6

Volume 6, Number 1-3, May 2009

• Stefan Szeider:
  Matched Formulas and Backdoor Sets. 1-12
  
• Utz-Uwe Haus, Klaus Truemper, Robert Weismantel:
  Linear Satisfiability Algorithm for 3CNF Formulas of Certain Signaling Networks. 13-32
  
• Roman Gershman, Ofer Strichman:
  HaifaSat: a SAT solver based on an Abstraction/Refinement model. 33-51
  
• Edward A. Hirsch, Arist Kojevnikov, Alexander S. Kulikov, Sergey I. Nikolenko:
  Complexity of Semialgebraic Proofs with Restricted Degree of Falsity. 53-69
  
• Luís Gil, Paulo F. Flores, Luis Miguel Silveira:
  PMSat: a parallel version of MiniSAT. 71-98
  
• Geoffrey Chu, Aaron Harwood, Peter J. Stuckey:
  Cache Conscious Data Structures for Boolean Satisfiability Solvers. 99-120
  
• Christoph Buchheim, Giovanni Rinaldi:
  Terse Integer Linear Programs for Boolean Optimization. 121-139
  
• Alexander Hertel, Alasdair Urquhart:
  Algorithms and Complexity Results for Input and Unit Resolution. 141-164
  
• Robert Brummayer, Armin Biere:
  Lemmas on Demand for the Extensional Theory of Arrays. 165-201
  

Volume 6, Number 4, June 2009

• Tobias Schubert, Matthew D. T. Lewis, Bernd Becker:
  PaMiraXT: Parallel SAT Solving with Threads and Message Passing. 203-222
  
• Antti Eero Johannes Hyvärinen, Tommi A. Junttila, Ilkka Niemelä:
  Incorporating Clause Learning in Grid-Based Randomized SAT Solving. 223-244
  
• Youssef Hamadi, Saïd Jabbour, Lakhdar Sais:
  ManySAT: a Parallel SAT Solver. 245-262
  
• Youssef Hamadi:
  Conclusion to the Special Issue on Parallel SAT Solving. 263
  

Last update Sat May 18 16:51:43 2013 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page