JiscMail Logo
Email discussion lists for the UK Education and Research communities

Help for CPHC-CONF Archives


CPHC-CONF Archives

CPHC-CONF Archives


cphc-conf@JISCMAIL.AC.UK


View:

Message:

[

First

|

Previous

|

Next

|

Last

]

By Topic:

[

First

|

Previous

|

Next

|

Last

]

By Author:

[

First

|

Previous

|

Next

|

Last

]

Font:

Proportional Font

LISTSERV Archives

LISTSERV Archives

CPHC-CONF Home

CPHC-CONF Home

CPHC-CONF  February 2012

CPHC-CONF February 2012

Options

Subscribe or Unsubscribe

Subscribe or Unsubscribe

Log In

Log In

Get Password

Get Password

Subject:

SAT 2012: Final Call for Papers

From:

Roberto Sebastiani <[log in to unmask]>

Reply-To:

Roberto Sebastiani <[log in to unmask]>

Date:

Thu, 2 Feb 2012 17:18:36 +0100

Content-Type:

text/plain

Parts/Attachments:

Parts/Attachments

text/plain (181 lines)

      [ 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.

SAT 2012 will take place in Trento, Italy, a cosmopolitan city set in
a spectacular mountain scenery, and home to a world-class university
and research centres.

RELEVANT TOPICS 
===============

The topics of the conference span practical and theoretical research
on SAT (in the broader sense above) and its applications, and include,
but are not limited to: 

* Theoretical issues
  - Combinatorial Theory of SAT
  - Proof Systems and Proof Complexity in SAT
  - Analysis of SAT Algorithms
* Solving: 
  - Improvements of current solving procedures
  - Novel solving procedures, techniques and heuristics
  - Incremental solving
* Beyond solving:
  - Functionalities (e.g., proofs, unsat-cores, interpolants,...)
  - Optimization 
* Applications 
  - SAT techniques for other domains
  - Novel Problem Encodings
  - Novel Industrial Applications of SAT

A more detailed description can be found on the web site.

INVITED SPEAKERS
================

We are honored to announce the following invited speakers at SAT 2012:

* Aaron Bradley, Boulder, USA. 
  "SAT-based Verification with IC3: Foundations and Demands"

* Donald Knuth, Stanford, USA.
  "Satisfiability and The Art of Computer Programming"

The presence of both speakers has been confirmed, although the titles
 of the talks may be provisional.

AFFILIATED EVENTS
=================

SAT 2012 is co-located with the 2nd International SAT/SMT Summer School
(June 12-15), http://satsmtschool2012.fbk.eu/.

SAT 2012 will also host related events like workshops (June 16) and various
competitive events.

PAPER SUBMISSION
================

Papers must be edited in LATEX using the LNCS format and
be submitted electronically as PDF files via EasyChair. 
We envisage three categories of submissions:

REGULAR PAPERS. Submissions, not exceeding fourteen (14) pages, should
  contain original research, and sufficient detail to assess the
  merits and relevance of the contribution. For papers reporting
  experimental results, authors are strongly encouraged to make their
  data available with their submission. Submissions reporting on case
  studies in an industrial context are strongly invited, and should
  describe details, weaknesses and strength in sufficient
  depth. Simultaneous submission to other conferences with proceedings
  or submission of material that has already been published elsewhere
  is not allowed.

TOOL PRESENTATIONS. Submissions, not exceeding six (6) pages, should
  describe the implemented tool and its novel features. A
  demonstration is expected to accompany a tool presentation. Papers
  describing tools that have already been presented in other
  conferences before will be accepted only if significant and clear
  enhancements to the tool are reported and implemented.

EXTENDED ABSTRACTS/POSTERS. Submissions, not exceeding two (2) pages,
  briefly introducing work in progress, student work, or preliminary
  results. These papers are expected to be presented as posters at the
  conference.

Further information about paper submission, including a more detailed
description of the scope and specification of the three submission
categories, will be made available at SAT 2012 web page. The review
process will be subject to a rebuttal phase. 

IMPORTANT DATES:
================
  Abstract Submission:			05/02/2012
  Paper Submission:		 	12/02/2012 
  Rebuttal phase:                    28-30/03/2012
  Final Notification:			12/04/2012      
  Final Version Due:			04/05/2012

  SAT/SMT School:                    12-15/06/2012
  Workshops:				16/06/2012
  Conference:                        17-20/06/2012

PROCEEDINGS
===========

The proceedings of SAT 2012 will be published by Springer-Verlag in the
LNCS series. 

PROGRAM CHAIRS
==============

Alessandro Cimatti -- FBK-Irst, Trento, Italy
Roberto Sebastiani -- DISI, University of Trento, Italy

PROGRAM COMMITTEE 
=================

Dimitris Achlioptas -- UC Santa Cruz, USA
Fahiem Bacchus -- University of Toronto, Canada
Paul Beame -- University of Washington, USA
Armin Biere -- Johannes Kepler University, Austria
Randal Bryant -- Carnegie Mellon University, USA
Uwe Bubeck -- University of Paderborn, Germany
Nadia Creignou -- Aix-Marseille Université, France
Leonardo DeMoura -- Microsoft Research, USA
John Franco -- University of Cincinnati, USA
Malay Ganai -- NEC, USA
Enrico Giunchiglia -- Università di Genova, Italy
Youssef Hamadi -- Microsoft Research, UK
Zyiad Hanna -- Jasper, USA
Holger Hoos -- University of British Columbia, Canada
Marijn Heule -- Johannes Kepler University, Austria
Kazuo Iwama -- Kyoto University, Japan
Oliver Kullmann -- Swansea University, UK
Daniel Le Berre -- Université d’Artois, France
Ines Lynce -- Instituto Superior Técnico, Portugal
Panagiotis Manolios -- Northeastern University, USA
Joao Marques-Silva -- University College Dublin, Ireland
David Mitchell -- Simon Fraser University, Canada
Alexander Nadel -- Intel, Israel
Jussi Rintanen -- The Austrailan National University, Australia
Lakhdar Sais -- Université d’Artois, France
Karem Sakallah -- University of Michigan, USA
Bart Selman -- Cornell University, USA
Laurent Simon -- Université Paris 11, France
Carsten Sinz -- Karlsruhe Institute of Technology, Germany
Niklas Sorensson -- Chalmers University, Sweden
Ofer Strichman -- Technion, Israel
Stefan Szeider -- Vienna University of Technology, Austria
Allen Van Gelder -- University of California, Santa Cruz, USA
Toby Walsh -- University of New South Wales, Australia
Xishun Zhao -- Sun Yat-Sen University, China

Top of Message | Previous Page | Permalink

JiscMail Tools


RSS Feeds and Sharing


Advanced Options


Archives

April 2024
March 2024
February 2024
January 2024
December 2023
November 2023
October 2023
September 2023
August 2023
July 2023
June 2023
May 2023
April 2023
March 2023
February 2023
January 2023
December 2022
November 2022
October 2022
September 2022
August 2022
July 2022
June 2022
May 2022
April 2022
March 2022
February 2022
January 2022
December 2021
November 2021
October 2021
September 2021
August 2021
July 2021
June 2021
May 2021
April 2021
March 2021
February 2021
January 2021
December 2020
November 2020
October 2020
September 2020
August 2020
July 2020
June 2020
May 2020
April 2020
March 2020
February 2020
January 2020
December 2019
November 2019
October 2019
September 2019
August 2019
July 2019
June 2019
May 2019
April 2019
March 2019
February 2019
January 2019
December 2018
November 2018
October 2018
September 2018
August 2018
July 2018
June 2018
May 2018
April 2018
March 2018
February 2018
January 2018
December 2017
November 2017
October 2017
September 2017
August 2017
July 2017
June 2017
May 2017
April 2017
March 2017
February 2017
January 2017
December 2016
November 2016
October 2016
September 2016
August 2016
July 2016
June 2016
May 2016
April 2016
March 2016
February 2016
January 2016
December 2015
November 2015
October 2015
September 2015
August 2015
July 2015
June 2015
May 2015
April 2015
March 2015
February 2015
January 2015
December 2014
November 2014
October 2014
September 2014
August 2014
July 2014
June 2014
May 2014
April 2014
March 2014
February 2014
January 2014
December 2013
November 2013
October 2013
September 2013
August 2013
July 2013
June 2013
May 2013
April 2013
March 2013
February 2013
January 2013
December 2012
November 2012
October 2012
September 2012
August 2012
July 2012
June 2012
May 2012
April 2012
March 2012
February 2012
January 2012
December 2011
November 2011
October 2011
September 2011
August 2011
July 2011
June 2011
May 2011
April 2011
March 2011
February 2011
January 2011
December 2010
November 2010
October 2010
September 2010
August 2010
July 2010
June 2010
May 2010
April 2010
March 2010
February 2010
January 2010
December 2009
November 2009
October 2009
September 2009
August 2009
July 2009
June 2009
May 2009
April 2009
March 2009
February 2009
January 2009
December 2008
November 2008
October 2008
September 2008
August 2008
July 2008
June 2008
May 2008
April 2008
March 2008
February 2008
January 2008
December 2007
November 2007
October 2007
September 2007
August 2007
July 2007
June 2007
May 2007
April 2007
March 2007
February 2007
January 2007
2006
2005
2004
2003
2002
2001
2000
1999
1998


JiscMail is a Jisc service.

View our service policies at https://www.jiscmail.ac.uk/policyandsecurity/ and Jisc's privacy policy at https://www.jisc.ac.uk/website/privacy-notice

For help and support help@jisc.ac.uk

Secured by F-Secure Anti-Virus CataList Email List Search Powered by the LISTSERV Email List Manager