For some time, the satisfiability formulae that have been the most difficult to solve for their size have been crafted to be unsatisfiable by the use of cardinality constraints. Recent solvers have introduced explicit checking of such constraints, rendering previously difficult formulae trivial to solve. A family of unsatisfiable formulae is described that is derived from the sgen4 family but cannot be solved using cardinality constraints detection and reasoning alone. These formulae were found to be the most difficult during the SAT2014 competition by a significant margin and include the shortest unsolved benchmark in the competition, sgen6- 1200-5-1.cnf.
Submission for the MAXSAT competition is now open. The deadline for submitting solvers and benchmarks is June 30.
CSPSAT 2015: Call for Papers Fifth International Workshop on the Cross-Fertilization Between CSP and SAT In conjunction with CP 2015 Cork, Ireland August 31, 2015
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.
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.
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.
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.
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.
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.”
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.
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.