keep up to date with research on the satisfiability problem
The Theory Group at KTH Royal Institute of Technology invites applications for postdoctoral positions in SAT solving.
The Vienna Center for Logic and Algorithms announces the 2015 edition of the VCLA International Student Awards and calls for the nomination of authors of outstanding scientific works in the field of Logic and Computer Science, in the following two categories:
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
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