--------------------------------------
| SAT 2010 - Final Call for Papers |
------------------------------------
| 13th International Conference on |
| Theory and Applications of |
| Satisfiability Testing |
------------------------------------
| July 11 - July 14, 2010 |
| Edinburgh, Scotland, UK |
| Part of FLoC 2010 |
------------------------------------
| http://ie.technion.ac.il/SAT10 |
--------------------------------------
CONFERENCE CHAIRS
Ofer Strichman, Technion, Israel
Stefan Szeider, TU Vienna, Austria
INVITED SPEAKERS
Yehuda Naveh, IBM Haifa Research Lab, Israel
Ramamohan Paturi, University of California, USA
IMPORTANT DATES
Abstract Submission: February 1, 2010
Paper Submission: February 8, 2010
Author Notification: March 15, 2010
Final Version: April 5, 2010
TECHNICAL PROGRAM COMMITTEE
Dimitris Achlioptas, UC Santa Cruz, USA
Fahiem Bacchus, University of Toronto, Canada
Armin Biere, Johannes Kepler University, Austria
Nadia Creignou, Universite de la Mediterranee, France
Stefan Dantchev, Durham University, UK
Adnan Darwiche, UCLA, USA
John Franco, University of Cincinnati, USA
Enrico Giunchiglia, Universita di Genova, Italy
Kazuo Iwama, Kyoto University, Japan
Hans Kleine, Buning, University of Paderborn, Germany
Oliver Kullmann, University of Wales Swansea, UK
Sais Lakhdar, Universite d'Artois, France
Daniel Le Berre, Universite d'Artois, France
Chu-Min Li, Universite de Picardie, France
Ines Lynce, Technical University of Lisbon, Portugal
Hans van Maaren, TU Delft, The Netherlands
Panagiotis Manolios, Northeastern University, USA
Joao Marques-Silva, University College Dublin, Ireland
David Mitchell, Simon Fraser University, Canada
Alexander Nadel, Tel-Aviv Univ. & Intel Corp., Israel
Robert Nieuwenhuis, Technical Univ. of Catalonia, Spain
Albert Oliveras, Technical Univ. of Catalonia, Spain
Ramamohan Paturi, University of California, USA
Igor Razgon, University College Cork, Ireland
Karem Sakallah, University of Michigan, USA
Roberto Sebastiani, Universita di Trento, Italy
Laurent Simon, Universite Paris 11, France
Carsten Sinz, University of Karlsruhe, Germany
Robert H. Sloan, University of Illinois at Chicago, USA
Miroslaw Truszczynski, University of Kentucky, USA
Alasdair Urquhart, University of Toronto, Canada
Allen Van Gelder, UC Santa Cruz, USA
Toby Walsh, NICTA and University of NSW, Australia
Emo Welzl, ETH Zurich, Switzerland
Lintao Zhang, Microsoft Research, P.R. China
Xishun Zhao, Sun Yat-Sen University, P.R. China
SCOPE AND MISSION
The International Conference on Theory and Applications of
Satisfiability Testing SAT is the primary annual meeting for
researchers studying the propositional satisfiability problem. SAT
2010 is the thirteenth SAT conference. SAT 2010 features the SAT
Race, the Pseudo-Boolean evaluation, and the MAX-SAT evaluation.
Many hard combinatorial problems can be encoded into SAT. Therefore
improvements on heuristics on the practical side, as well as
theoretical insights into SAT, apply to a large range of real-world
problems. More specifically, many important practical verification
problems can be rephrased as SAT problems. This applies to
verification problems in hardware and software. Thus SAT is becoming
one of the most important core technologies to verify secure and
dependable systems. 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 rather broad sense: besides propositional
satisfiability, it includes the domain of quantified boolean
formulae (QBF), constraints programming techniques (CSP) for
word-level problems and their propositional encoding and
particularly satisfiability modulo theories (SMT).
SUBMISSIONS
Paper submissions should contain original material and can either be
regular research papers up to 14 pages or short papers up to 6
pages. Submitted papers may include a technical appendix in addition
to the page restriction; however, the paper must be intelligible
without the appendix and PC members are not required to read the
appendix. Regular papers may be accepted as short papers, by
decision of the program committee. Double submissions including
submissions as short and long papers will be rejected. Submissions
should use the Springer LNCS style (see
www.springer.com/comp/lncs/Authors.html). All tables, figures and
the bibliography must fit into the page limit. Appendices that the
author considers as part of the final submission should fit in the
page limit as well. Submissions deviating from these requirements
may be rejected without review. All accepted papers including short
papers will be published in the proceedings of the conference, which
are expected to be published in Springer's LNCS series. The
submission page is www.easychair.org/conferences/?conf=sat10.
Papers have to be submitted electronically as PDF files.
AFFILIATED EVENTS
SAT'10 Workshop Chair:
Carsten Sinz, University of Karlsruhe, Germany
SAT'10 Workshops:
* 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)
SAT'10 Competitions:
* MAX-SAT Evaluation 2010
* Pseudo-Boolean Competition 2010
* SAT-Race 2010
Information about SAT affiliated events can be found through the
conference's web site
http://ie.technion.ac.il/SAT10
SAT 2010 is one of eight conferences in the Federated Logic
Conference FLoC 2010, see
http://floc-conference.org/index.html
_______________________________________________
uai mailing list
uai@ENGR.ORST.EDU
https://secure.engr.oregonstate.edu/mailman/listinfo/uai
