SAT Live! is currently being redesigned. Features are added incrementally to the site. Do not hesitate to fill in an issue for feature requests, ideas for improving the site, report problems.

Recent news about SAT subscribe via RSS

 

  • Jul 15, 2015  FoSSaCS 2016 by Valentin Montmirail modal-logic  CFP 

    19th International Conference on Foundations of Software Science and Computation Structures (FoSSaCS), April 2016, Eindhoven, The Netherlands.
  • Jul 13, 2015  Advances in Modal Logic 2016 by Valentin Montmirail modal-logic  CFP 

    11th International Conference on Advances in Modal Logic, 2016, Budapest, Hungary.
  • Jul 6, 2015  FMCAD Student Forum 2015 by Georg Weissenbacher CFP 

    The deadline of this year's FMCAD student forum has been extended - the new deadline is July 09, 2015.
  • Jul 2, 2015  SAT & CSP Track at IEEE ICTAI 2015 by Jean-Marie Lagniez CFP 

    Due to many requests, a new submission deadline has been fixed.
  • Jun 12, 2015  22nd RCRA workshop (RCRA 2015) by Marco Maratea CFP 

    This event follows the series of the RCRA (Knowledge Representation and Automated Reasoning) annual meetings, held since 1994. The success of the previous events shows that RCRA is becoming a major forum for exchanging ideas and proposing experimentation methodologies for algorithms in Artificial Intelligence.
  • Jun 11, 2015  Fifth International Workshop on the Cross-Fertilization Between CSP and SAT by Yael Ben-Haim CFP 

    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
    
  • Jun 2, 2015  SAT & CSP Track at IEEE ICTAI 2015 by Jean-Marie Lagniez CFP 

    Following the success of the first and second editions of the SAT and CSP technologies special track at ICTAI 2013 and ICTAI 2014, this year again the IEEE-ICTAI conference will highlight a track dedicated to SAT and CSP.
  • Jun 1, 2015  Weakening Cardinality Constraints Creates Harder Satisfiability Benchmarks by Ivor Spence Benchmarks 

    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.

  • May 25, 2015  MAXSAT 2015 Evaluation by Jordi Planes Competition  CFP 

    Submission for the MAXSAT competition is now open. The deadline for submitting solvers and benchmarks is June 30.

  • May 20, 2015  ACAI’15 Summer School on Constraints Solving Techniques in AI by Daniel Le Berre Event 

    In odd-numbered years, the European Coordinating Committee for Artificial Intelligence (ECCAI) sponsors a specialised course in Artificial Intelligence, called Advanced Course on Artificial Inteliigence (ACAI).
  • May 16, 2015  22th RCRA workshop (RCRA 2015) by Marco Maratea CFP 

    The RCRA group (Knowledge Representation & Automated Reasoning) of theAI*IA (Italian Association for Artificial Intelligence) organizes the 22th RCRA workshop: Experimental evaluation of algorithms for solving problems with combinatorial explosion (RCRA 2015)
  • May 11, 2015  CFP QUANTIFY 2015 by Florian Lonsing CFP  QBF 

    The goal of the 2nd International Workshop on Quantification (QUANTIFY 2015) is to bring together researchers who investigate the impact of quantification from a theoretical as well as from a practical point of view.
  • Apr 30, 2015  Fifth International Workshop on the Cross-Fertilization Between CSP and SAT by Yael Ben-Haim CFP 

    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
    
  • Apr 23, 2015  SAT'15 Deadline Extended by Sean Weaver CFP 

    Abstract submission deadline for SAT'15 extended to April 29th!
  • Apr 22, 2015  Overview and analysis of the SAT Challenge 2012 solver competition by Adrian Balint, Anton Belov, Matti Järvisalo and Carsten Sinz Competition 

    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.

  • Apr 17, 2015  13th International Conference on Logic Programming and Non-monotonic Reasoning by Francesco Calimeri CFP 

    Updated deadlines.
  • Apr 3, 2015  18th Int. Conf. on Theory and Applications of Satisfiability Testing by Sean Weaver CFP 

    Abstract submission deadline for SAT'15 is April 22nd!
  • Mar 18, 2015  New version 1.2 of PBLib is out! by Peter Steinke PBO 

    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.

  • Mar 18, 2015  ICCL Summer School on Reasoning in Dresden, Germany, September 13 - 26, 2015 by Peter Steinke CFP 

    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.

  • Mar 13, 2015  CFP QUANTIFY 2015 by Florian Lonsing CFP  QBF 

    The goal of the 2nd International Workshop on Quantification (QUANTIFY 2015) is to bring together researchers who investigate the impact of quantification from a theoretical as well as from a practical point of view.
  • Mar 2, 2015  13th International Conference on Logic Programming and Non-monotonic Reasoning by Francesco Calimeri CFP 

    Complimentary membership offer for conference registrants new to AAAI.
  • Feb 28, 2015  Savile Row 1.6.2 Released with SAT backend by Daniel Le Berre Tools 

    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.

  • Feb 17, 2015  SAT-Race 2015 by Tomas Balyo Competition  CFP 

    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.

  • Feb 8, 2015  Outstanding Thesis Award for Boolean Satisfiability by Daniel Le Berre Distinction 

    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.”

  • Feb 3, 2015  PB 2015 competition by Norbert Manthey Competition  PBO 

    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.

  • Jan 27, 2015  Postdoc position (SAT, constraints, optimization) by Matti Jarvisalo PostDoc  Position 

    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.

  • Jan 12, 2015  SAT2015 second call for workshops by Sean Weaver CFP 

    Workshop proposals for the SAT conference is open now. Check out the details ...
  • Jan 9, 2015  PhD position - Parallel SAT Solving by Norbert Manthey PhD  Position 

    TU Dresden offers a PhD position within on parallel SAT solving, which offers both theoretical and applied research.
  • Jan 3, 2015  13th Int. Conf. on Logic Programming and Non-monotonic Reasoning by Francesco Calimeri CFP 

    LPNMR 2015 associated events are now announced.
  • Dec 20, 2014  PhD position in QBF solving at Vienna University of Technology, Austria by Stefan Szeider Position  PhD  QBF 

    There is an opening for a funded PhD position in Quantified Boolean Formula (QBF) solving at the Vienna University of Technology, Vienna, Austria.
  • Dec 4, 2014  13th Int. Conf. on Logic Programming and Non-monotonic Reasoning by Francesco Calimeri CFP 

    LPNMR 2015 will be collocated with the 4th Conference on Algorithmic Decision Theory 2015.
  • Nov 8, 2014  SAT2015 First call for workshops by Sean Weaver CFP 

    Workshop proposals for the SAT conference is open now. Check out the details ...
  • Nov 8, 2014  JSAT Special Issue on SAT 2014 COMPETITIONS AND EVALUATIONS by Marijn Heule CFP 

    A special issue for the participants of SAT 2014 competitive events.
  • Nov 8, 2014  31st International Conference on Logic Programming by Michael Fink CFP 

    ICLP 2015 will be co-located with CP 2015 during The Year of George Boole.
  • Oct 9, 2014  VCLA International Student Awards by Stefan Szeider Awards 

    The Vienna Center for Logic and Algorithms calls for the nomination of authors of outstanding scientific works in the field of Logic and Computer Science.
  • Oct 9, 2014  18th Int. Conf. on Theory and Applications of Satisfiability Testing by Sean Weaver CFP 

    The next SAT conference is taking place in Austin. Check the submission deadline now!
  • Jun 20, 2014  PostDoctoral position proposal in Propositional Satisfiability by Lakhdar Saïs Position  PostDoc 

    Algorithms for Inference and Constraints group (CRIL, CNRS UMR 8188), at Lens (France), is offering a postDoctoral position.
  • Jun 9, 2014  CFP ModRef 2014 by Carlos Ansotegui CFP 

    The 13th International Workshop on Constraint Modelling and Reformulation will take place in Lyon during CP'14.
  • Jun 4, 2014  ICTAI'14 Special Track on SAT and CSP by Bertrand Mazure CFP 

    Over the years, the ICTAI conference has become a major forum for the CSP and SAT research communities for presenting new high-quality results. The second edition of the special track is intended to further develop the role of ICTAI in this respect.
  • May 29, 2014  FLoC'14 Travel Support by Ines Lynce Grants 

    FLoC has some additional funds to provide travel grants of up to $750 for student attendees of FLoC’14. Funds can be requested to cover airfare and lodging (registration fees and meals will not be funded).
  • May 23, 2014  Funded Doctoral Positions in Austria (LogiCS) by Stefan Szeider Positions,  PhD 

    TU Wien, TU Graz, and JKU Linz are seeking exceptionally talented and motivated students for their joint doctoral program LogiCS.
  • May 13, 2014  Bridging the Gap Between Theory and Practice in Constraint Solvers by Philippe Jegou CFP 

    This one-day workshop will be held at CP 2014, the 20th International Conference on Principles and Practice of Constraint Programming.
  • May 9, 2014  Configurable SAT Solver Challenge (CSSC) 2014 by Franck Hutter CFP 

    Following last year's inaugural Configurable SAT Solver Challenge (CSSC), we will hold CSSC 2014, a competitive event that assesses the peak performance of such parametric solvers (i.e. performance with optimized parameters).
  • May 8, 2014  Workshop on Logic and Search - LaSh'2014 by Marc Denecker CFP 

    The purpose of the LaSh workshops is to foster scientific exchange on subjects related to languages for representing, and methods for solving, computationally challenging search problems.
  • May 2, 2014  11th Workshop on Boolean Problems by Miroslav Velev CFP 

    Extended Deadline for 11th International Workshop on Boolean Problems (IWSBP’14).
  • Apr 3, 2014  Call for contributions - QBF Gallery 2014 by Martina Seidl CFP 

    The QBF Gallery 2014 invites submissions of competing QBF solvers (PCNF as well as non-PCNF solvers), related tools like preprocessors as well as novel benchmark instances to challenge current solvers.
  • Apr 1, 2014  Sr. R&D Engineer / Software Architect - Formal verification by Atrenta Position 

    Atrenta is hiring a senior engineer with good skills around SAT and SMT. See announce for details.
  • Mar 26, 2014  SAT 2014 competition: call for solvers and benchmarks by Marijn Heule CFP 

    SAT Competition 2014 invites submissions of both competing SAT solvers and new competition benchmark instances.
  • Mar 24, 2014  7th Workshop on Answer Set Programming and Other Computing Paradigms by Marco Maratea CFP 

    This workshop will facilitate the discussion about crossing the boundaries of current ASP techniques in theory, solving, and applications, in combination with or inspired by other computing paradigms.
  • Mar 21, 2014  iPrA 2014 - 2nd workshop on interpolation: from proofs to applications by Georg Weissenbacher CFP 

    Recently, interpolants are increasingly used in automated verification, synthesis, and description logics. The aim of the workshop is to bring together theoreticians and practitioners from these different fields.
  • Mar 17, 2014  Call for participation - Fourth SAT/SMT summer school by Georg Weissenbacher CFP 

    The fourth edition follows the schools that took place at MIT (SAT/SMT Solver Summer School 2011), at Fondazione Bruno Kessler (SAT/SMT School 2012) in Trento, Italy, and Aalto University in Espoo, Finland in 2013.

Our scientific association

The SAT association

Upcoming deadlines

December 4, 2015
FoSSaCS'16
August 1, 2016
AIML'16

SAT related books