Recent news about SAT subscribe via RSS

• May 13, 2022  Postdoc positions in TCS and/or combinatorial optimization (deadline June 29) by Jakob Nordström PhD  Position  Deadline 

  The Department of Computer Science (DIKU) at the University of Copenhagen invites applications for postdoc positions in theoretical computer science and/or combinatorial optimization.

• May 13, 2022  PhD positions in TCS and/or combinatorial optimization (deadline June 29) by Jakob Nordström PhD  Position  Deadline 

  The Department of Computer Science (DIKU) at the University of Copenhagen invites applications for PhD positions in theoretical computer science and/or combinatorial optimization.

• Apr 29, 2022  Vardifest: A workshop in Honor of Moshe Vardi by Kuldeep S. Meel CFP  Deadline 

  The VardiFest titled *On the Not So Unusual Effectiveness of Logic* is a FLoC-22 workshop in honor of Moshe Vardi and is intended to celebrate Moshe Vardi's pioneering contributions that has enhanced logic's centrality in Computer science.

• Apr 11, 2022  Fully-funded PhD Position on Innovative Applications of SAT Techniques (Stefan Szeider, TU Wien, Vienna, Austria) by Stefan Szeider Position  PhD  Deadline 

  The deadline for applying to those two SAT related PhD positions is the end of the month (April 30).

• Apr 11, 2022  10 PhD Positions in Computer Science at TU Wien, Vienna, Austria by Stefan Szeider PhD  Position  Deadline 

  The deadline for applying to those 10 full-time PhD positions is the end of this month (April 30).

• Mar 14, 2022  CFP - 9th International Workshop on Quantified Boolean Formulas and Beyond by Florian Lonsing CFP  Deadline  QBF 

  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.

• Mar 7, 2022  20th International Workshop on Satisfiability Modulo Theories by Antti Hyvarinen CFP  Deadline 

  The 20th edition of the SMT workshop is taking place in Haifa, and we're looking for contributions!

• Feb 8, 2022  Lecturer Position in Optimisation (CP/MIP/SAT/SMT) by Alexey Ignatiev Position  Lecturer  Deadline 

  We are now seeking to add your expertise to the role of Lecturer - (Data Science & AI) within the Optimisation Group of the Department of Data Science and Artificial Intelligence.

• Jan 30, 2022  Call for Participation: Competitive Evaluation of QBF Solvers by Luca Pulina CFP  Deadline 

  QBFEVAL'22 is the 2022 competitive evaluation of QBF solvers, and the fifteenth event aimed to assess the performance of QBF solvers. QBFEVAL'22 awards solvers that stand out as being particularly effective on specific categories of QBF instances. We warmly encourage developers of QBF solvers to submit their work, even at early stages of development, as long as it fulfills some very simple requirements. We also welcome the submission of QBF formulas to be used for the evaluation.

• Dec 20, 2021  Tenure-track assistant professorship in complexity theory (deadline Jan 30) by Jakob Nordström PhD  Position  Deadline 

  The Department of Computer Science (DIKU) at the University of Copenhagen invites applications for a tenure-track assistant professorship in computational complexity theory.

• Dec 7, 2021  Reminder: Two PhD Positions on Innovative Applications of SAT Techniques (Stefan Szeider, TU Wien, Vienna, Austria) by Stefan Szeider Position  PhD  Deadline 

  The deadline for applying to those two SAT related PhD positions is the end of the month (Dec. 30).

• Dec 7, 2021  Reminder: 20 PhD Positions in Computer Science at TU Wien, Vienna, Austria by Stefan Szeider PhD  Position  Deadline 

  The deadline for applying to those 20 full-time PhD positions is the end of this month (Dec. 30).

• Nov 29, 2021  Core Challenge 2022 (an International Competition for Combinatorial Reconfiguration) by Takehide Soh CFP  Competition  SAT  Deadline 

  The 1st Combinatorial Reconfiguration Challenge (CoRe Challenge 2022) is a competition aiming for practically exploring the combinatorial reconfiguration problem.

• Nov 20, 2021  CS Professorships at Aalto University, Finland by Jussi Rintanen Position  Deadline 

  The CS Department of Aalto University calls for applications for tenure-track Assistant Professorship in all areas of Computer Science.

• Oct 29, 2021  Postdoc positions in combinatorial optimization (deadline November 28) by Jakob Nordström PhD  Position  Deadline 

  The Department of Computer Science (DIKU) at the University of Copenhagen invites applications for postdoc positions in combinatorial optimization.

• Oct 29, 2021  PhD positions in TCS and combinatorial optimization (deadline November 28) by Jakob Nordström PhD  Position  Deadline 

  The Department of Computer Science (DIKU) at the University of Copenhagen invites applications for PhD positions in theoretical computer science and combinatorial optimization.

• Oct 25, 2021  Formal Method full professorship position @ JKU Linz by Martina Seidl Position  Deadline 

  The Johannes Kepler University Linz has an opening for a full professorship in Formal Methods.

• Oct 11, 2021  Two PhD Positions on Innovative Applications of SAT Techniques (Stefan Szeider, TU Wien, Vienna, Austria) by Stefan Szeider Position  PhD 

  There is an opening for two PhD positions on innovative applications of SAT techniques (that includes, SAT, MaxSAT, (D)QBF, and related techniques), with theoretical and experimental objectives.

• Oct 11, 2021  20 PhD Positions in Computer Science at TU Wien, Vienna, Austria by Stefan Szeider PhD  Position 

  The novel interdisciplinary Marie Skłodowska-Curie COFUND doctoral training programme LogiCS@TUWien co-funded by the European Commission, will offer 20 full-time PhD positions.

• Oct 10, 2021  SAT 2022 Call for Papers by Kuldeep S. Meel CFP  SAT  Deadline 

  The International Conference on Theory and Applications of Satisfiability Testing (SAT) is the premier annual meeting for researchers focusing on the theory and applications of the propositional satisfiability problem, broadly construed. In 2022, it is organized within FLoC in Haifa, Israel.