[clean-list] FTP 2009: First call for papers

[Viorica Sofronie-Stokkermans]

             [We apologize for multiple copies]

====================================================================
                      CALL FOR PAPERS
====================================================================
                          FTP 2009
       International Workshop on First-Order Theorem Proving
                   Oslo, Norway, July 6-7 2009

              http://www.mpi-inf.mpg.de/~sofronie/ftp09/
====================================================================

FTP 2009 is the seventh in a series of workshops intended to focus
effort on First-Order Theorem Proving as a core theme of Automated
Deduction, and to provide a forum for presentation of recent work
and discussion of research in progress.

The workshop welcomes original contributions on theorem proving
in first-order classical, many-valued, modal and description logics,
including (but not restricted to):

  * theorem proving in first-order classical, many-valued,
    and modal logics, including:
      -  satisfiability in propositional logic,
      - satisfiability modulo theories,
      - specialized decision procedures,
      - constraint reasoning,
      - equational reasoning,
      - term rewriting,
      - resolution,
      - paramodulation/superposition;

  * strategies and complexity of theorem proving procedures;
  * implementation techniques;
  * applications of first-order theorem provers to:
      - program verification,
      - model checking,
      - artificial intelligence,
      - mathematics,
      - computational linguistics.

Previous editions of FTP took place in
Schloss Hagenberg, Austria (1997); Vienna, Austria (1998);
St Andrews, Scotland (2000); Valencia, Spain (2003);
Koblenz, Germany (2005); and Liverpool, UK (2007).
For more information about FTP, its scope and previous
workshops, please see the FTP Workshop Series web page
http://www.csc.liv.ac.uk/FTP-WS/ .


Paper Submissions
=================

Authors are invited to submit papers in the following categories:

  * Extended abstracts of up to 15 pages describing original results.

  * Position papers of up to 10 pages describing work in progress,
    or future directions of research.

  * System descriptions of up to 10 pages, describing new systems or
    significant upgrades of existing ones, especially including
    experiments; sources and manuals of systems will have to be freely
    available online.

  * Presentation-only papers, describing work recently published or
    submitted (no page limit). These will not be included in the
    proceedings, but pre-prints or post-prints can be made available
    to participants. We see this as a way to provide additional
    access to important developments that FTP Workshop attendees
    may be unaware of.

Authors are encouraged to use LaTeX and the standard article class/style
file (10pt or 11pt). The first page should contain the title, the authors'
names, e-mail and postal addresses.

Submissions should be made via Easychair at the following address:
http://www.easychair.org/conferences/?conf=ftp2009

Publication
===========
Accepted submissions will be published as a technical report
of the University of Oslo and will be distributed at the workshop.
They will also be available on the web. As for the previous editions
of FTP, a journal special issue is planned after the workshop.
The submission will be open to papers on First-Order Theorem
Proving.


Important dates
===============
Full paper submission deadline:                 20 April 2009
Notification of acceptance/rejection:           27 May 2009
Final version due:                              10 June 2009
Workshop:                                       July 6-7, 2009

Program Chairs
==============
* Nicolas Peltier(                   (CNRS - LIG)
* Viorica Sofronie-Stokkermans       (Max-Planck-Institut für Informatik,
                                      Saarbrücken)

Programme Committee
===================
* Alessandro Armando                  (DIST - Univ. Genova)
* Franz Baader                        (TU Dresden)
* Peter Baumgartner                   (National ICT Australia)
* Bernhard Beckert                    (Univ. Koblenz)
* Maria Paola Bonacina                (Univ. degli Studi di Verona)
* Ricardo Caferra                     (Grenoble INP - LIG)
* Martin Giese                        (Univ. Oslo)
* Ullrich Hustadt                     (Univ. Liverpool)
* Alexander Leitsch                   (Vienna Univ. of Technology)
* Christopher Lynch                   (Clarkson University)
* Nicola Olivetti                     (LSIS, Univ. Paul Cézanne, Marseille)
* Nicolas Peltier (co-chair)          (CNRS - LIG)
* David Plaisted                      (Univ. North Carolina-Chapel Hill)
* Silvio Ranise                       (Univ. degli Studi di Verona)
* Michael Rusinowitch                 (LORIA - INRIA Lorraine)
* Renate Schmidt                      (The Univ. Manchester)
* Viorica Sofronie-Stokkermans (co-chair) (Max-Planck-Institut für
                                           Informatik, Saarbrücken)
* Arild Waaler                        (Univ. of Oslo)
* Christoph Weidenbach                (Max-Planck-Institut für
                                      Informatik, Saarbrücken)


Local organization
==================
Roger Antonsen                        (University of Oslo)