22st International Conference on Theory and Applications of Satisfiability Testing CFP

Страна: Португалия

Город: Lisbon

Тезисы до: 01.03.2019

Даты: 07.07.19 — 12.07.19

Область наук: Технические;

Е-мейл Оргкомитета: daniel@satlive.org

Организаторы: SAT


SAT 2019 welcomes scientific contributions addressing different aspects of the satisfiability problem, interpreted in a broad sense. Domains include MaxSAT and Pseudo-Boolean (PB) constraints, Quantified Boolean Formulae (QBF), Satisfiability Modulo Theories (SMT), as well as Constraint Satisfaction Problems (CSP). Topics include, but are not restricted to:

  • Theoretical advances (including algorithms, proof complexity, parameterized complexity, and other complexity issues);
  • Practical search algorithms;
  • Knowledge compilation;
  • Implementation-level details of SAT solving tools and SAT-based systems;
  • Problem encodings and reformulations;
  • Applications (including both novel applications domains and improvements to existing approaches);
  • Case studies and reports on insightful findings based on rigorous experimentation.

Веб-сайт конференции: http://sat2019.tecnico.ulisboa.pt/

Конференции по теме - с близкими дедлайнами: