Registration to JELIA 2019 is now open! Deadline for early registration is March 31st, 2019.
As we have done in the past we are seeking proposals for hosting and organizing SAT 2020.
The Twenty-Fifth Conference on Principles and Practice of Constraint Programming (CP 2019) will take place in Stamford (CT), USA, September 30 to October 4, 2019. Stamford is one hour away from NYC by train.
4th International Workshop on Satisfiability Checking and Symbolic Computation, Wed. 10 July 2019, University of Bern, Switzerland.
There is an opening for a fully funded research assistant position (PhD student) at the Algorithms and Complexity group at TU Wien, Vienna, Austria.
Post-doctoral and Ph.D. thesis positions in SAT, constraints, search and applications offered at the CS department of Aalto University in Helsinki, Finland. Apply by February 7, 2019.
The TCS Group at KTH Royal Institute of Technology invites applications for postdoc positions in computer science focused on algorithms for solving the Boolean satisfiability problem (SAT) very efficiently for large classes of instances, and on analyzing and understanding such algorithms.
The Vienna Center for Logic and Algorithms (VCLA) at TU Wien seeks nominations for the VCLA International Student Awards 2019. The annually awarded VCLA International Student Awards for Outstanding Master and Undergraduate Research (Bachelor) Theses (or equivalent) recognize authors of scientific works across the wide spectrum of Logic and Computer Science. Final Submission Deadline: 15.3.2019
Female students in the field of computer science (CS) who plan to pursue (or are currently pursuing) one of the master‘s programs in Computer Science at the Vienna University of Technology – TU Wien taught in English are invited to apply for the annually awarded Helmut Veith Stipend.
The Journal on Satisfiability, Boolean Modeling and Computation (JSAT), the open access journal of the SAT association, is now accepting submissions using its new easychair-based journal management system.