-
The 2021 MaxSAT Evaluation (MSE 2021) is the 15th edition of MaxSAT evaluations, the primary competition-style event focusing on the evaluation of MaxSAT solvers organized yearly since 2006.
-
Due to the COVID-19 pandemic, the 27th Conference on Principles and Practice of Constraint Programming will be transformed into a fully virtual event.
-
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.
-
A CACM article presents the resolution of the Keller Conjecture for dimension 7 using SAT technology.
-
Due to the COVID-19 pandemic, the 27th Conference on Principles and Practice of Constraint Programming will be transformed into a fully virtual event.
-
The Vienna Center for Logic and Algorithms of TU Wien (Vienna University of Technology), calls for the nomination of authors of outstanding theses and scientific works in the field of Logic and Computer Science.
-
The deadline for submitting benchmarks and solvers has been extended to April 23, 2021.
-
The International Pragmatics of SAT Workshop is organized again this year, as a joint event with SAT'21. Considering the success of the online event last year, the event will be at least broadcasted online this year.
-
The 2021 SAT Competition is a competitive event for solvers of the Boolean Satisfiability (SAT) problem. It is organized as a satellite event to the 24th International Conference on Theory and Applications of Satisfiability Testing and stands in the tradition of the yearly SAT Competitions, Races, and Challenges.
-
The second edition of the Handbook of Satisfiability is now available
-
This message is to spread the news that everybody interested can now take part in the seminars during the semester programs Satisfiability: Theory, Practice, and Beyond and Theoretical Foundations of Computer Systems running at the Simons Institute at UC Berkeley this spring.
-
The Simons Institute Theoretical Foundations of Computer Systems Boot Camp will take place from Jan 25 to Jan 29 virtually.
-
The Simons Institute Satisfiability: Theory, Practice, and Beyond Boot Camp will take place from Feb 1 to Feb 5, 2021, virtually.
-
The annual international workshop on Satisfiability Modulo Theories will be held in Los Angeles, United States, from July 16-25, 2021.
-
The annual international SAT conference will be held in Barcelona, Spain, from July 5-9, 2021.
-
The Department of Computer Science (DIKU) at the University of Copenhagen invites applications for postdoctoral positions in combinatorial optimization.
-
The SAT+SMT school is organized each year in an indian city in December since 2016. This year,
due to COVID, the school will be fully online. As such, everybody is welcome to attend the school.
-
The CS Department of Aalto University calls for applications for tenure-track Assistant Professorship in all areas of Computer Science. The CS Department is very well funded, availability of research funding in Finland in general is very good, and the positions come with a generous start-up package that funds a new research group for a number of years. Quality of life in Helsinki is internationally very competitive on multiple scales, and Finland is globally known as one of the progressive and technologically advanced Nordic societies.
-
The Keller’s conjecture is a 90 years old conjecture by Ott-Heinrich Keller that in any tiling of Euclidean space by identical hypercubes there are two cubes that meet face to face. The conjecture was know to be true up to dimension 6, and false in dimensions higher than 7. The conjecture was open for dimension 7.
-
The Vienna Center for Logic and Algorithms of TU Wien (VCLA) has the pleasure to announce
the recipients of the VCLA International Student Awards for Outstanding Master and Undergraduate Theses in Logic and Computer Science.