SAT 2013
16th International Conference on Theory and Applications of Satisfiability Testing

July 8-12, 2013   ·   Helsinki, Finland

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.

SAT 2013 Accepted Presentation-Only Posters

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