FOM: workshop on satisfiability testing
Stephen G Simpson
simpson at math.psu.edu
Mon Jan 29 09:30:30 EST 2001
From: Martin Grohe <lics at math.uic.edu>
To: lics-list at math.uic.edu
Subject: LICS'01 Workshop on Satisfiability Testing
Date: Thu, 25 Jan 2001 18:38:04 -0600 (CST)
Call for Papers
Workshop on Theory and Applications of Satisfiability Testing
Affiliated with LICS 2001
June 14-15, 2001, Boston, Massachusetts
Workshop Home Page: http://www.cs.washington.edu/homes/kautz/sat2001/
Great strides have been made in recent years in the theory and practice
of propositional satisfiability testing. On the theoretical side, a
wide range of mathematical approaches -- ranging from classical
combinatorial analysis to arguments based on statistical physics --
have increased our understanding of problem hardness. On the
practical side, new systematic and non-systematic search algorithms
have increased the size of problems that can be solved by several
orders of magnitude. As a result there is an growing interest in
using SAT as a practical tool for solving real-world problems, as well
as using the insights gained from SAT research to create
problem-specific solutions.
The purpose of this workshop is to bring together researchers from
different communities -- including theory, artificial intelligence,
verification, mathematical theorem-proving, and operations research --
in order to share ideas and increase synergy between theoretical and
empirical work.
Invited Speakers
Alasdair Urquhart (University of Toronto)
Daniel Jackson (M.I.T.)
Michael Littman (AT&T Laboratories)
Program Committee
Henry Kautz (University of Washington)
Bart Selman (Cornell University)
John Franco (University of Cincinnati)
Paul Beame (University of Washington)
Mark Stickel (SRI)
Toby Walsh (York University)
David McAllester (AT&T Laboratories)
Daniel Jackson (M.I.T.)
Matthew Ginsberg (University of Oregon)
Carla Gomes (Cornell University)
Important Dates
Submission of papers and/or requests to participate: March 15, 2001.
Decisions returned: April 15, 2001.
Workshop: June 14 - 15, 2001.
Paper Guidelines
Papers should be limited to 8 pages (any format). IMPORTANT:
European authors should format their paper for "letter" size paper
(8.5 inch by 11 inch) paper, not the default A4 size. In Latex this
can be done by
\documentclass[letterpaper]{article}
Papers should be submitted electronically by March 15, 2000. If the
paper will be presented at the main LICS conference or any other
conference paper indicate this clearly on both the email and first
page of the paper.
The paper submission procedure is as follows:
1. Send an email message to <kautz at cs.washington.edu> with the
following information:
paper title:
first author name:
first author email:
first author telephone:
first author home page:
names of coauthors:
brief abstract:
is this paper also at LICS?:
file name:
The last is the name of the file containing your paper. It should
be your first and last names separated by a dash, e.g.
henry-kautz.ps
The file may be in postscript .ps or PDF .pdf formats only.
2. FTP the paper itself as follows: From a command prompt, type
ftp ftp.cs.washington.edu
(login:) anonymous
(password:) YOUR_EMAIL_ADDRESS
cd sat2001/incoming
put YOUR_FILE
If you wish to participate in the workshop but not submit a paper,
please send an email to <kautz at cs.washington.edu> by March 15 with the
contact information described above.
In order to increase time for free discussion, some authors may be
asked to give short (10 minute) overviews of their work rather than
a full talk. All accepted papers will appear in an online set of
working notes.
More Information
The work immediately precedes the Sixteenth Annual IEEE Symposium on
Logic in Computer Science (LICS 2001), June 16 - 19, 2001, at Boston
University. For information on travel and housing see the main
conference website:
http://www.cs.bu.edu/faculty/mairson/LICS01/index.html
For information about the workshop see
http://www.cs.washington.edu/homes/kautz/sat2001/
or email Henry Kautz <kautz at cs.washington.edu>.
More information about the FOM
mailing list