Recent news about SAT subscribe via RSS

• Dec 20, 2016  First CFP - SAT 2017 - August 28 - September 1, 2017 - Melbourne, Australia by Daniel Le Berre CFP 

  The next SAT conference will take place in Melbourne, right after IJCAI, together with CP and ICLP.

• Dec 19, 2016  QBFEVAL 2017 - Preliminary Call For Benchmarks by QBF  Deadline 

  QBFEVAL'17 will be the 2017 competitive evaluation of QBF solvers, and the twelfth evaluation of QBF solvers and instances ever. QBFEVAL'17 will award solvers that stand out as being particularly effective on specific categories of QBF instances.

• Jun 27, 2016  CFP 9th Workshop on Answer Set Programming and Other Computing Paradigms by Amelia Harrison CFP  Deadline  ASP 

  Submission deadline extended to July 4

• Jun 6, 2016  HBench - A new GUI-based platform on Windows for performance benchmarking by Ofer Strichman Tools 

  HBench provides a simple one-form GUI for managing performance-oriented research of algorithms. It runs your engine over a set of benchmarks with multiple parameter sets, collects statistics into a csv file, prepares scatter/cactus plots, lets the user control the active cores, and much more. It supports both remote execution on a linux cluster and running on a local windows machine. It makes the whole benchmarking process much easier.

• May 5, 2016  SAT/SMT/AR summer school, Lisbon, Portugal by Ines Lynce CFP  SAT  SMT  Deadline 

  EXTENDED APPLICATION DEADLINE: May 15th, 2016

• Apr 29, 2016  International Workshop on Graph Structure and Satisfiability Testing by Stefan Mengel CFP  Deadline 

  Deadline extended to May 18.

• Apr 29, 2016  Seventh Pragmatics of SAT international workshop by Olivier Roussel CFP  Deadline 

  The deadline for paper submission has been extended to May 8.

• Apr 29, 2016  6th International Workshop on the Cross-Fertilization Between CSP and SAT by Yael Ben-Haim CFP  Deadline 

  Constraint Satisfaction Problems (CSP's) and Boolean Satisfiability Problems (SAT) have much in common. However, they also differ in many important aspects, which result in major differences in solution techniques. More importantly, the CSP and SAT communities, while to some extent interacting with each other, are mostly separate communities with separate conferences and meetings. This workshop is designed as a venue for bridging the gap and for cross-fertilization between the two communities, in terms of ideas, problems, techniques, and results.

• Apr 22, 2016  CFP - 4th International Workshop on Quantified Boolean Formulas (and Beyond) by Florian Lonsing CFP  Deadline  QBF 

  Submission deadline extended to May 8.

• Apr 22, 2016  12th International Workshop on Boolean Problems by Miroslav Velev CFP  Deadline 

  The Workshop on Boolean Problems has an emphasis on the problems related to the solution of all kinds of high- dimension Boolean and discrete problems, and provides a forum for researchers and engineers from different disciplines to exchange ideas. The workshop is devoted to theoretical discoveries as well as practical applications. An aim of the workshop is to initiate possible collaborative research and to find new areas of application.

• Mar 28, 2016  PB16 - Pseudo-Boolean Competition 2016 by Olivier ROUSSEL CFP  Deadline  PBO 

  The site for submitting pseudo-Boolean solvers or benchmarks to the 2016 competition will open soon. Like the previous evaluations and competitions (PB05, PB06, PB07, PB09, PB10, PB11, PB12, PB Evaluation 2015), the goal of PB16 is to assess the state of the art in the field of pseudo-Boolean solvers.

• Mar 12, 2016  International Workshop on Graph Structure and Satisfiability Testing by Stefan Mengel CFP 

  The goal of the International Workshop on Graph Structure and Satisfiability Testing is to bring together researchers from different areas in which there is an interaction between graph structure and problems related to propositional satisfiability. The aim is to foster exchange between these areas by presenting different perspectives, results and current challenges.

• Mar 11, 2016  CFP - 4th International Workshop on Quantified Boolean Formulas (and Beyond) by Florian Lonsing CFP  Deadline  QBF 

  The goal of the International Workshop on Quantified Boolean Formulas (and Beyond) is to bring together researchers working on theoretical and practical aspects of QBF solving and related formalisms involving quantifiers. The workshop addresses theoreticians and practitioners in order to reflect on the state of the art in research and to consolidate on immediate and long-term challenges.

• Mar 3, 2016  CALL FOR BENCHMARKS -- SAT COMPETITION 2016 by Marijn Heule Competition  Deadline 

  We would like to invite and encourage submissions of benchmarks and benchmark generators for SAT Competition 2016. Visit the competition homepage for details.

• Feb 15, 2016  Final CFP - SAT 2016 - July 5-8, 2016 Bordeaux, France by Daniel Le Berre CFP  Deadline 

  Final Call For Papers. Abstracts can still be submitted until Feb 21 (same deadline as papers). Submitted papers can be updated until Feb 24.

• Dec 23, 2015  SAT/SMT/AR summer school, Lisbon, Portugal by Philipp Rümmer SAT  SMT 

  This year, the SAT/SMT summer school joins forces with the automated reasoning community to propose a SAT/SMT/AR summer school right before IJCAR.

• Dec 22, 2015  QBFEVAL'16 - Competitive evaluation of QBF solvers by Luca Pulina CFP  Deadline  QBF 

  ******************************************************************
  Call for Solvers & Benchmarks
  QBFEVAL'16 - Competitive evaluation of QBF solvers
  
  A joint event with SAT 2016 - The Nineteenth International Conference
  on Theory and Applications of Satisfiability Testing - Bordeaux,
  France, July 5-8, 2016
  ******************************************************************
  

• Dec 22, 2015  International Workshop on Quantified Boolean Formulas by Florian Lonsing QBF 

  The website of the QBF16 workshop is online.

• Dec 22, 2015  Seventh Pragmatics of SAT international workshop by Olivier Roussel CFP  Deadline 

  The website of the seventh pragmatics of SAT international workshop is now online.

• Dec 17, 2015  The SAT Revolution: Solving, Sampling, And Counting by Moshe Vardi by Daniel Le Berre Course 

  Moshe Vardi introduces NP-complete problems, P vs NP, SAT and related problems.