2 Feb 19:18
[PT] SAT 2012: Final Call for Papers
[ We apologize if you receive multiple copies of this CFP. ]
-------------------------------------------------------------------------
15th International Conference on
THEORY AND APPLICATIONS OF SATISFIABILITY TESTING
--- SAT 2012 ---
Trento, Italy, June 17-20th, 2012
http://sat2012.fbk.eu/
-------------------------------------------------------------------------
AIM and SCOPE
=============
The International Conference on Theory and Applications of
Satisfiability Testing (SAT) is the primary annual meeting for
researchers studying the propositional satisfiability
problem. Importantly, here SAT is interpreted in a rather broad sense:
besides plain propositional satisfiability, it includes the domains of
MaxSAT and Pseudo-Boolean (PB) constraints, Quantified Boolean
Formulae (QBF), Satisfiability Modulo Theories (SMT), Constraints
Programming (CSP) techniques for word-level problems and their
propositional encoding.
To this extent, many hard combinatorial problems can be encoded as SAT
instances, in the broad sense mentioned above, including problems that
arise in hardware and software verification, AI planning and
scheduling, OR resource allocation, etc. The theoretical and practical
advances in SAT research over the past twenty years have contributed
to making SAT technology an indispensable tool in these domains.
(Continue reading)
RSS Feed