Overview

  • The International Conference on Theory and Applications of Satisfiability Testing is the primary annual meeting for researchers studying the propositional satisfiability problem (SAT).
  • SAT'10 is part of FLoC'10, the Federated Logic Conference 2010
  • The invited speakers of SAT'10 are Yehuda Naveh (IBM Haifa Research Lab, Israel) and Ramamohan Paturi (University of California, USA)
  • SAT'10 hosts the SAT Race, the Pseudo-Boolean Evaluation, and the MAX-SAT Evaluation
  • See www.satisfiability.org for information on previous meetings

Scope

The topics of the conference span practical and theoretical research on SAT and its applications and include but are not limited to:

  • Proof Systems and Proof Complexity
  • Search Algorithms and Heuristics
  • Analysis of Algorithms
  • Combinatorial Theory of Satisfiability
  • Random Instances vs Structured Instances
  • Problem Encodings
  • Industrial Applications
  • Applications to Combinatorics
  • Solvers, Simplifiers and Tools
  • Case Studies and Empirical Results
  • Exact and Parameterized Algorithms

SAT is interpreted in a broad sense: besides propositional satisfiability, it includes the domains of pseudo-Boolean constraint solving and optimization (PB), quantified boolean formulae (QBF), constraint programming techniques (CSP) for word-level problems and their propositional encoding, satisfiability modulo theories (SMT), model counting and MAX SAT.

Call for Papers

PDF TXT

Affiliated Events

There are five workshops (and three competitions) affiliated with SAT’10:

PPC10

Propositional Proof Complexity: Theory and Practice

POS-10

Pragmatics of SAT

LoCoCo 2010

Workshop on Logics for Component Configuration

SMT 2010

International Workshop on Satisfiability Modulo Theories (with CAV)

LaSh 2010

3rd International Workshop on Logic and Search (with ICLP)

For more details see the affiliated events' web-page .

The organizer of SAT's affiliated events is Carsten Sinz.