SAT 2013 Accepted Papers

Out of a total of 65 technical paper submissions (including 50 regular and 15 short paper submissions) and 6 tool paper submissions, 26 technical papers (acceptance rate 40%, including 21 regular and 5 short papers) and 5 tool papers were accepted.

• Gilles Audemard, Jean-Marie Lagniez and Laurent Simon:
  Improving Glucose for Incremental SAT Solving with Assumptions: Application to MUS Extraction.
• Anton Belov, Norbert Manthey and Joao Marques-Silva:
  Parallel MUS Extraction.
• Olaf Beyersdorff:
  The Complexity of Theorem Proving in Autoepistemic Logic.
• Uwe Bubeck and Hans Kleine Büning:
  Nested Boolean Functions as Models for Quantified Boolean Formulas.
• Alessandro Cimatti, Alberto Griggio, Bastiaan Joost Schaafsma and Roberto Sebastiani:
  A Modular Approach to MaxSAT Modulo Theories.
• Jessica Davies and Fahiem Bacchus:
  Exploiting the Power of MIPs Solvers in Maxsat.
• Ronald de Haan, Iyad Kanj and Stefan Szeider:
  Local Backbones.
• Johannes Dellert, Christian Zielke and Michael Kaufmann:
  MUStICCa: MUS Extraction with Interactive Choice of Candidates (Tool paper).
• Marcelo Finger, Carla Gomes, Ronan Le Bras and Bart Selman:
  Solutions for Hard and Soft Constraints Using Optimized Probabilistic Satisfiability.
• Hiroshi Fujita, Miyuki Koshimura and Ryuzo Hasegawa:
  SCSat: A Soft Constraint Guided SAT Solver (Tool paper).
• Oliver Gableske:
  On the Interpolation between Product-Based Message Passing Heuristics for SAT.
• Alexandra Goultiaeva and Fahiem Bacchus:
  Recovering and Utilizing Partial Duality in QBF.
• Marijn Heule and Stefan Szeider:
  A SAT Approach to Clique-Width.
• Alexey Ignatiev, Mikolas Janota and Joao Marques-Silva:
  Quantified Maximum Satisfiability: A Core-Guided Approach.
• Mikolas Janota and Joao Marques-Silva:
  On Propositional QBF Expansions and Q-Resolution.
• Jan Johannsen:
  Exponential Separations in a Hierarchy of Clause Learning Proof Systems.
• Charles Jordan and Lukasz Kaiser:
  Experiments with Reduction Finding.
• Massimo Lauria:
  A Rank Lower Bound for Cutting Planes Proofs of Ramsey's Theorem.
• Florian Lonsing, Uwe Egly and Allen Van Gelder:
  Efficient Clause Learning for Quantified Boolean Formulas via QBF Pseudo Unit Propagation.
• Norbert Manthey, Tobias Philipp and Christoph Wernhard:
  Soundness of Inprocessing in Clause Sharing SAT Solvers.
• Jean Marie Lagniez and Armin Biere:
  Factoring Out Assumptions to Speed-Up MUS Extraction.
• Ruben Martins, Vasco Manquinho and Inês Lynce:
  Community-based Partitioning for MaxSAT Solving.
• Andrew Mihal and Steve Teig:
  A Constraint Satisfaction Approach for Programmable Logic Detailed Placement.
• Neeldhara Misra, Sebastian Ordyniak, Venkatesh Raman and Stefan Szeider:
  Upper and Lower Bounds for Weak Backdoor Set Detection.
• Mordechai Moti Ben-Ari:
  LearnSAT: A SAT Solver for Education (Tool paper).
• Igor Razgon and Justyna Petke:
  Cliquewidth and Knowledge Compilation.
• Horst Samulowitz, Chandra Reddy, Ashish Sabharwal and Meinolf Sellmann:
  Snappy: A Simple Algorithm Portfolio (Tool paper).
• Carsten Sinz, Markus Iser and Mana Taghdiri:
  Minimizing Models for Tseitin-Encoded SAT Instances.
• Takehide Soh, Naoyuki Tamura and Mutsunori Banbara:
  Scarab: A Rapid Prototyping Tool for SAT-based Constraint Programming Systems (Tool paper).
• Jacobo Toran:
  On the Resolution Complexity of Graph Non-Isomorphism.
• Siert Wieringa and Keijo Heljanko:
  Concurrent Clause Strengthening.

The following poster abstracts were accepted for presentation based on a separate Call for Presentation-Only Posters.

• Glauber De Bona and Marcelo Finger:
  Probabilistic Satisfiability via Satisfiability Modulo Theory
• Ahmed Irfan, Davide Lanti and Norbert Manthey:
  Parallel SAT Solving with Search Space Partitioning
• Oleg Zaikin and Alexander Semenov:
  On estimating total time to solve SAT in distributed computing environments: Application to the SAT@home project
• Naoyuki Tamura, Takehide Soh, Mutsunori Banbara, and Katsumi Inoue:
  CSPSAT Projects and their SAT Related Tools
• Mark Liffiton, Alessandro Previti, Ammar Malik, and Joao Marques-Silva:
  A Novel, Efficient Approach for Enumerating MUSes
• Danny Dolev, Juho Hirvonen, Janne H. Korhonen, Christoph Lenzen, Joel Rybicki and Jukka Suomela:
  SAT Solvers in Computational Algorithm Design
• Hidetomo Nabeshima, Koji Iwanuma, and Katsumi Inoue:
  GlueMiniSat 2.2.7: On-The-Fly Lazy Clause Simplification