Program at a Glance

PROCEEDINGS

SAT 2012 proceedings are published by Springer as Volume 7317 in the Lecture Notes in Computer Science series.

Program at a glance as pdf-file

DETAILED PROGRAMME OF THE SAT 2012 CONFERENCE

To obtain the file with the slides of each presentation, click on its title.

For Donald Knuth's invited talk and Q&A, a video is also available.

SUNDAY 17

MONDAY 18

  • [09.00-11.00] APPLICATIONS [chair: Silva]
  • [11.00-11.30] COFFEE BREAK
  • [11.30-13.00] PARALLEL & PORTFOLIO SAT SOLVING [chair: Manolios]
  • [13.00-14.30] LUNCH BREAK
  • [14.30-15.30] CDCL SAT SOLVING [chair: Sorensson]
  • [15.30-16.30] POSTERS & DEMOS [Posters and demos will be presented in parallel]
    • Ashutosh Gupta.
      Improved Single Pass Algorithms for Resolution Proof Reduction (Poster Presentation)
    • Sebastian Burg, Stephan Kottler and Michael Kaufmann.
      Creating Industrial-Like SAT Instances by clustering and reconstruction (Poster Presentation)
    • Paolo Marin, Christian Miller and Bernd Becker.
      Incremental QBF Preprocessing for Partial Design Verification (Poster Presentation)
    • Peter van der Tak, Marijn Heule and Armin Biere.
      Concurrent Cube-and-Conquer (Poster Presentation)
    • Chu Min Li and Yu Li.
      Satisfying versus falsifying in local search for satisfiability (Poster Presentation)
    • Chu-Min Li, Wanxia Wei and Yu Li.
      Exploiting historical relationships of clauses and variables in local search for satisfiability (Poster Presentation)
    • Alejandro Arbelaez and Philippe Codognet.
      Towards Massively Parallel Local Search for SAT (Poster Presentation)
    • Markus Iser, Mana Taghdiri and Carsten Sinz.
      Optimizing MiniSAT Variable Orderings for the Relational Model Finder Kodkod (Poster presentation)
    • Mark Liffiton and Jordyn Maglalang.
      A Cardinality Solver: More Expressive Constraints for Free (Poster Presentation)
    • Sam Bayless and Alan Hu.
      Single-Solver Algorithms for 2QBF (Poster Presentation)
    • Emir Demirović and Haris Gavranović.
      An Efficient Method for Solving UNSAT 3-SAT and Similar Instances Via Static Decomposition (Poster Presentation)
    • Said Jabbour, Jerry Lonlac and Lakhdar Sais.
      Intensification Search in Modern SAT Solvers (Poster Presentation)
    • Iago Abal, Alcino Cunha, Joe Hurd and Jorge Sousa Pinto.
      Using Term Rewriting to Solve Bit-Vector Arithmetic Problems (Poster Presentation)
    • George Katsirelos and Laurent Simon.
      Learning Polynomials over GF(2) in a SAT Solver (Poster Presentation)
    • Ashish Sabharwal, Horst Samulowitz and Meinolf Sellmann.
      Learning Back-Clauses in SAT (Poster Presentation)
    • Arie Matsliah, Ashish Sabharwal and Horst Samulowitz.
      Augmenting Clause Learning with Implied Literals (Poster Presentation)
  • [16.30-17.00] COFFEE BREAK
  • [17.00-19.00] PRESENTATION OF COMPETITIONS [chair: Le Berre]

TUESDAY 19

  • [09.00-10.00] REGISTRATION
  • [10.00-10.15] Welcome, presentation of the speaker
  • [10.15-11.15] INVITED TALK [chairs: Cimatti and Sebastiani] 
  • [11.15-11.45] INTERVAL
  • [11.45-12.45] Q&A WITH DONALD KNUTH [chairs: Cimatti and Sebastiani]
    • Donald Knuth.
        Question & Answers (The video is available here)
  • [12.45-13.45] LUNCH BREAK
  • [13.45-22.00] EXCURSION AND CONFERENCE DINNER

WEDNESDAY 20