Recent news about SAT subscribe via RSS

• Apr 23, 2015  SAT'15 Deadline Extended by Sean Weaver CFP 

  Abstract submission deadline for SAT'15 extended to April 29th!

• Apr 22, 2015  Overview and analysis of the SAT Challenge 2012 solver competition by Adrian Balint, Anton Belov, Matti Järvisalo and Carsten Sinz Competition 

  Programs for the Boolean satisfiability problem (SAT), i.e., SAT solvers, are nowadays used as core decision procedures for a wide range of combinatorial problems. Advances in SAT solving during the last 10–15 years have been spurred by yearly solver competitions. In this article, we report on the main SAT solver competition held in 2012, SAT Challenge 2012. Besides providing an overview of how SAT Challenge 2012 was organized, we present an in-depth analysis of key aspects of the results obtained during the competition.

• Apr 17, 2015  13th International Conference on Logic Programming and Non-monotonic Reasoning by Francesco Calimeri CFP 

  Updated deadlines.

• Apr 3, 2015  18th Int. Conf. on Theory and Applications of Satisfiability Testing by Sean Weaver CFP 

  Abstract submission deadline for SAT'15 is April 22nd!

• Mar 18, 2015  New version 1.2 of PBLib is out! by Peter Steinke PBO 

  Many different encodings for Pseudo-Boolean (PB) constraints into conjunctive normal form (CNF) have been proposed in the past. The PBLib project starts to collect and implement these encodings to be able to encode PB constraints in a very simple, but effective way.

• Mar 18, 2015  ICCL Summer School on Reasoning in Dresden, Germany, September 13 - 26, 2015 by Peter Steinke CFP 

  The summer school “Reasoning” is a platform for knowledge transfer within a very rapid increasing research community in the field of “Computational Logic”. We will offer introductory courses covering the fundamentals of reasoning, courses at advanced levels, as well as applied courses and workshops dedicated to specialized topics and the state of the art. All lecturers are leading researchers in their field and have been awarded prizes.

• Mar 13, 2015  CFP QUANTIFY 2015 by Florian Lonsing CFP  QBF 

  The goal of the 2nd International Workshop on Quantification (QUANTIFY 2015) is to bring together researchers who investigate the impact of quantification from a theoretical as well as from a practical point of view.

• Mar 2, 2015  13th International Conference on Logic Programming and Non-monotonic Reasoning by Francesco Calimeri CFP 

  Complimentary membership offer for conference registrants new to AAAI.

• Feb 28, 2015  Savile Row 1.6.2 Released with SAT backend by Daniel Le Berre Tools 

  The main change in 1.6.2 is the addition of the SAT backend. The first iteration of this feature was written by Patrick Spracklen as a summer student project. All constraints in the language have a SAT encoding. MiniSat and Lingeling are fully supported as backend solvers: 1.6.2 can run them, parse the solution and collect some statistics from the solver.

• Feb 17, 2015  SAT-Race 2015 by Tomas Balyo Competition  CFP 

  SAT-Race 2015 is a competitive event for solvers of the Boolean Satisfiability (SAT) problem. It is organized as a satellite event to the 18th International Conference on Theory and Applications of Satisfiability Testing, September 24-27, 2015, Austin, Texas, USA and stands in the tradition of the yearly SAT Competitions and SAT-Races / Challenges. In contrast to the SAT Competitions, the focus of SAT-Race is on application benchmarks only.

• Feb 8, 2015  Outstanding Thesis Award for Boolean Satisfiability by Daniel Le Berre Distinction 

  Kuldeep Singh Meel, a doctoral student in computer science at Rice University, has won the 2014 Outstanding Master Thesis Award presented by the Vienna Center for Logic and Algorithms for his thesis titled “Sampling Techniques for Boolean Satisfiability.”

• Feb 3, 2015  PB 2015 competition by Norbert Manthey Competition  PBO 

  The pseudo Boolean evaluation 2015 analyzes the current state of the art of pseudo Boolean solving technology to be able to determine the progress that has been made since the last evaluation. Therefore, we invite solver developers to submit the latest version of their tools. Furthermore, we will include selected solvers of the previous pseudo Boolean competition 2012.

• Jan 27, 2015  Postdoc position (SAT, constraints, optimization) by Matti Jarvisalo PostDoc  Position 

  The Constraint Reasoning and Optimization group, led by Dr. Matti Jarvisalo at the University of Helsinki, Finland, is looking for one or more talented and highly motivated postdoctoral researchers to work with us.

• Jan 12, 2015  SAT2015 second call for workshops by Sean Weaver CFP 

  Workshop proposals for the SAT conference is open now. Check out the details ...

• Jan 9, 2015  PhD position - Parallel SAT Solving by Norbert Manthey PhD  Position 

  TU Dresden offers a PhD position within on parallel SAT solving, which offers both theoretical and applied research.

• Jan 3, 2015  13th Int. Conf. on Logic Programming and Non-monotonic Reasoning by Francesco Calimeri CFP 

  LPNMR 2015 associated events are now announced.

• Dec 20, 2014  PhD position in QBF solving at Vienna University of Technology, Austria by Stefan Szeider Position  PhD  QBF 

  There is an opening for a funded PhD position in Quantified Boolean Formula (QBF) solving at the Vienna University of Technology, Vienna, Austria.

• Dec 4, 2014  13th Int. Conf. on Logic Programming and Non-monotonic Reasoning by Francesco Calimeri CFP 

  LPNMR 2015 will be collocated with the 4th Conference on Algorithmic Decision Theory 2015.

• Nov 8, 2014  SAT2015 First call for workshops by Sean Weaver CFP 

  Workshop proposals for the SAT conference is open now. Check out the details ...

• Nov 8, 2014  JSAT Special Issue on SAT 2014 COMPETITIONS AND EVALUATIONS by Marijn Heule CFP 

  A special issue for the participants of SAT 2014 competitive events.