Call for Papers, Call for Tutorials and Call for Workshop Proposals


International Conference

Automated Reasoning with Analytic Tableaux and Related Methods

Oslo, Norway 6.-10. July 2009


Workshop & Tutorial submission:Friday, 9. Jan 2009
Workshop & Tutorial notification:Friday 23. Jan
Abstract and Title:Monday, 26. Jan
Paper Submission:Monday, 2. Feb
Notification:Tuesday, 24. Mar
End of rebuttal phase:Friday, 27. Mar
Final Notification:Friday, 3. Apr
Final Versions:Friday, 24. Apr
Early registration:Sunday, 7. Jun
Conference:Tuesday 7. to Friday 10. July


This conference is the 18th in a series of international meetings on Automated Reasoning with Analytic Tableaux and Related Methods.

In July 2009, the conference will be held in Oslo, Norway. The conference proceedings will be published in the LNAI series as in the previous editions of the conference.

See for more information on TABLEAUX 2009, and for information about the TABLEAUX conference series.

Tableaux 2009 will be collocated with FTP 2009, the workshop on First-Order Theorem Proving, see


Tableau methods are a convenient formalism for automating deduction in various non-standard logics as well as in classical logic. Areas of application include verification of software and computer systems, deductive databases, knowledge representation and its required inference engines, and system diagnosis. The conference brings together researchers interested in all aspects - theoretical foundations, implementation techniques, systems development and applications - of the mechanization of reasoning with tableaux and related methods.

Topics of interest include (but are not restricted to):

  • analytic tableaux for various logics (theory and applications)
  • related techniques and concepts, e.g., model checking and BDDs
  • related methods (model elimination, sequent calculi, connection method, ...)
  • new calculi and methods for theorem proving in classical and non-classical logics (modal, description, intuitionistic, linear, temporal, many-valued...)
  • systems, tools, implementations and applications.

As in previous years, TABLEAUX 2009 puts a special emphasis on applications. Papers describing applications of tableaux and related methods in areas such as hardware and software verification, semantic technologies, knowledge engineering, etc. are particularly invited.

One or more tutorials will be part of the conference program.


The conference will include contributed papers, tutorials, system descriptions, position papers and invited lectures. Submissions are invited in four categories:

Research papers (reporting original theoretical and/or experimental research, up to 15 pages)
System descriptions (up to 5 pages)
Position papers and brief reports on work in progress
Tutorials in all areas of analytic tableaux and related methods from academic research to applications (proposals up to 5 pages)

Submissions in categories A and B will be reviewed by peers, typically members of the program committee. They must be unpublished and not submitted for publication elsewhere. For category B submissions a working implementation must exist and be available to the referees. After the notification, there will be a rebuttal phase of three days during which the authors of rejected papers will have the opportunity to respond to the reviews. Accepted papers in these categories will be published in the conference proceedings.

Submissions in category C will be reviewed by members of the program committee and a collection of the accepted papers in this category will be published as a Technical Report of the University of Oslo.

Tutorial submissions (Category D) may be at introductory, intermediate, or advanced levels. Novel topics and topics of broad interest are preferred. The submission should include the title, the author, the topic of the tutorial, its level, its relevance to conference topics, and a description of the interest and the scientific contents of the proposed tutorial. Tutorial proposals will be reviewed by members of the program committee.

Authors of accepted papers are expected to present their work at the conference.


TABLEAUX 2009 launches a Call for Workshop Proposal on specialised subjects in the range of the conference topics. We can accept up to 2 proposals. The proposals are reviewed by members of the PC committee. The purpose of a workshop is to offer an opportunity of presenting novel ideas, ongoing research, and to discuss the state of the art of an area in a less formal but more focused way than the conference itself. It is also a good opportunity for young researchers to present their own work and to obtain feedback. The format of a workshop is left to the the organizers, but it is expected to contain significant time for discussion. The intended schedule is for one-day workshops.

To submit a workshop proposal, please send a description of one or two pages to the PC chairs by Friday, 9. Jan 2009.


Apart from significantly reduced conference fees, students have access to budget accommodation at a rate of about 170 EUR for the whole week.

If necessary, we will be able to provide further financial help. Please contact the conference chairs! Lack of funds should not prevent you from participating in Tableaux 2009!


We are pleased to announce that the following speakers have accepted to give invited talks at Tableaux 2009:

  • Patrick Blackburn, INRIA Nancy, France
Family Secrets
  • Peter Jeavons, Oxford University Computing Laboratory, UK (Joint speaker with FTP)
Introducing Constraints
I will introduce the constraint satisfaction problem and show that it unifies a very wide variety of computational problems. I will then discuss the techniques that have been used to analyse the complexity of different forms of constraint satisfaction problem. I will focus on the algebraic approach, explaining the basic ideas and highlighting some of the recent results in this area.
  • Pierre Wolper, Université de Liege, Belgium
On the Use of Automata for Deciding Linear Arithmetic
This talk presents a survey of automata-based techniques for representing and manipulating linear arithmetic constraints. After introducing the basic concepts used in this approach, both representing integer constraints by finite-word automata and real constraints by infinite-word automata is discussed. Various results about the construction of automata from constraints and about the specific properties of automata representing arithmetic constraints are then presented. Finally, it is shown how this approach leads to simple and natural decision procedures that are in some ways related to tableaux.


PC Chairs

  • Martin Giese, Univ. of Oslo, Norway
  • Arild Waaler, Univ. of Oslo, Norway

PC Members

  • Peter Baumgartner, NICTA, Canberra, Australia
  • Bernhard Beckert, Univ. of Koblenz-Landau, Germany
  • Christoph Benzmüller, Saarland Univ., Saarbrücken, Germany
  • Marc Bezem, Univ. of Bergen, Norway
  • Torben Braüner, Roskilde Univ., Denmark
  • Agata Ciabattoni, TU Wien, Austria
  • Marta Cialdea Mayer, Univ. of Rome 3, Italy
  • Stéphane Demri, CNRS, Cachan, France
  • Roy Dyckhoff, Univ. of St Andrews, Scotland
  • Ulrich Furbach, Univ. of Koblenz-Landau, Germany
  • Didier Galmiche, LORIA, Henri Poincaré Univ., Nancy, France
  • Valentin Goranko, Technical University of Denmark
  • Rajeev Goré, The Australian National Univ., Canberra, Australia
  • Reiner Hähnle, Chalmers Univ., Göteborg, Sweden
  • Ullrich Hustadt, Univ. of Liverpool, UK
  • Christoph Kreitz, Univ. Potsdam, Germany
  • George Metcalfe, Vanderbilt Univ., Nashville, USA
  • Neil V. Murray, Univ. at Albany - SUNY, USA
  • Nicola Olivetti, Paul Cézanne University, Marseille, France
  • Jens Otten, Univ. Potsdam, Germany
  • Nicolas Peltier, LIG, Grenoble, France
  • Ulrike Sattler, Univ. of Manchester, UK
  • Viorica Sofronie-Stokkermans, MPI, Saarbrücken, Germany
  • Frank Wolter, Univ. of Liverpool, UK


Conference and program co-chairs:

Local organization

Page last modified on December 09, 2008, at 11:41 AM