|
|
News
| ♦ |
|
New collaboration |
| |
I am now working closely with colleagues at Ft. George
Meade, Maryland until late March, 2010 on a number of projects
including improving SBSAT.
|
| |
|
| ♦ |
|
6th Workshop on Constraints in Formal Verification '09 |
| |
The main goals of the Constraints in Formal Verification workshop are
to bring together researchers from the CSP/SAT and the formal
verification communities, to describe new applications of constraint
technology to formal verification, to disseminate new challenging
problem instances, and to propose new dedicated algorithms for hard
formal verification problems. The workshop will be held in Grenoble,
France, June 26, 2009. It is a satellite event of CAV'09.
•
Workshop website
|
| |
|
| ♦ |
|
11th International Symposium on
Artificial Intelligence and Mathematics |
| |
ISAIM is a biennial meeting that fosters interactions between
mathematics, theoretical computer science, and artificial
intelligence. The series was started by Martin Golumbic, and the
editorial board of the Annals of Mathematics and Artificial
Intelligence serves as the permanent Advisory
Committee. Traditionally, the Symposium attracts participants from a
variety of disciplines, thereby providing a unique forum for
scientific exchange. The three-day symposium includes invited
speakers, presentations of technical papers, and special topic
sessions.
The next conference will be January 6-8, 2010 in Ft. Lauderdale,
Florida. There will be a Boolean meeting from January 4-6, 2010 at
the same location. Organizers of the Boolean meeting are Endre Boros
and Yves Crama.
•
2008 conference website
|
| |
|
| ♦ |
|
11th International Symposium on the Theory and
Applications of Satisfiability Testing |
| |
The International Conference on Theory and Applications of
Satisfiability Testing is the primary annual meeting for researchers
studying the propositional satisfiability problem (SAT).
•
Conference
website
|
| |
|
| ♦ |
|
Handbook of Satisfiability |
| |
Volume 185
IOS Press
|
|
Contents, Part I (Theory and Algorithms): A History of Satisfiability,
CNF Encodings, Complete Algorithms, CDCL Solvers, Look-Ahead Based SAT
Solvers, Incomplete Algorithms, Fundamentals of Branching Heuristics,
Random Satisfiability, Exploiting Runtime Variation in Complete Solvers,
Symmetry and Satisfiability, Minimal Unsatisfiability and Autarkies,
Worst-Case Upper Bounds, Fixed-Parameter Tractability; Part II
(Applications and Extensions): Bounded Model Checking, Planning and
SAT, Software Verification, Combinatorial Designs by SAT Solvers,
Connections to Statistical Physics, MaxSAT, Model Counting,
Non-Clausal SAT and ATPG, Pseudo-Boolean and Cardinality Constraints,
QBF Theory, QBFs Reasoning, SAT Techniques for Modal and Description
Logics, Satisfiability Modulo Theories, Stochastic Boolean
Satisfiability.
Details: Frontiers in Artificial Intelligence and Applications.
eds: A. Biere, M. Heule, H. van Maaren, T. Walsh.
February 2009, 980 pp.
ISBN: 978-1-58603-929-5
|
|
|
|
|
|
