Welcome to TABLEAUX 2017 in Brasília!

The 26th International Conference on Automated Reasoning with Analytic Tableaux and Related Methods will take place in Brasília - the garden city of Brazil and UNESCO World Heritage Site for its modernistic design. It will be hosted by the Department of Computer Science at the University of Brasília, Brazil, from 25-28 September 2017.

TABLEAUX is the main international conference at which research on all aspects, theoretical foundations, implementation techniques, systems development and applications, of the mechanization of tableaux-based reasoning and related methods is presented. The first TABLEAUX conference was held in Lautenbach near Karlsruhe, Germany, in 1992. Since then it has been organised on an annual basis; in 2001, 2004, 2006, 2008, 2010, 2012, 2014, 2016 as a constituent of IJCAR.

TABLEAUX 2017 will be co-located with the 11th International Symposium on Frontiers of Combining Systems (FroCoS 2017) and the 8th International Conference on Interactive Theorem Proving (ITP 2017). The conferences will provide a rich programme of workshops, tutorials, invited talks, paper presentations and system descriptions.

The proceedings for TABLEAUX 2017 conference will be published in the Springer series Lecture Notes in Artificial Intelligence (LNAI).

JK Bridge


Tableau methods offer a convenient and flexible set of tools for automated reasoning in classical logic, extensions of classical logic, and a large number of non-classical logics. For large groups of logics, tableau methods can be generated automatically. Areas of application include verification of software and computer systems, deductive databases, knowledge representation and its required inference engines, teaching, and system diagnosis.

Topics of interest include but are not limited to:

  • tableau methods for classical and non-classical logics (including first-order, higher-order, modal, temporal, description, hybrid, intuitionistic, substructural, relevance, non-monotonic logics) and their proof-theoretic foundations;
  • related methods (SMT, model elimination, model checking, connection methods, resolution, BDDs, translation approaches);
  • sequent calculi and natural deduction calculi for classical and non-classical logics, as tools for proof search and proof representation;
  • flexible, easily extendable, light weight methods for theorem proving;
  • novel types of calculi for theorem proving and verification in classical and non-classical logics;
  • systems, tools, implementations, empirical evaluations and applications (provers, logical frameworks, model checkers, ...);
  • implementation techniques (data structures, efficient algorithms, performance measurement, extensibility, ...);
  • extensions of tableau procedures with conflict-driven learning, generation of proofs; compact (or humanly readable) representation of proofs;
  • decision procedures, theoretically optimal procedures;
  • applications of automated deduction to mathematics, software development, verification, deductive and temporal databases, knowledge representation, ontologies, fault diagnosis or teaching.
  • We also welcome papers describing applications of tableau procedures to real world examples. Such papers should be tailored to the tableau community and should focus on the role of reasoning, and logical aspects of the solution.

    National Congress

    Anniversary Session

    This year we celebrate the 25th anniversary of TABLEAUX, a series of meetings which started with the workshop Theorem Proving with Analytic Tableaux and Related Methods held in Lautenbach, Germany, in March 1992. We are planning for a special session, including two invited talks by Wolfgang Bibel and Reiner Hähnle.

    Ipê Amarelo

    Invited Speakers

  • Carlos Areces (FaMAF - Universidad Nacional de Córdoba, Argentina)

    Title: to be announced

    Abstract: to be announced

  • Wolfgang Bibel (Technische Universität Darmstadt, Germany) (TABLEAUX anniversary session)

    Title: A Vision for Automated Deduction Rooted in the Connection Method

    Abstract: The talk presents an informal overview of the Connection Method in Automated Deduction. In particular, it points out its unique advantage over competing methods which consists in its formula-orientedness. Among the consequences of this unique feature are three striking advantages, viz. uniformity (over many logics), performance (due to its extreme compactness and evidenced by the leanCoP family of provers), and a global view over the proof process (enabling a higher-level guidance of the proof search). These aspects are discussed on the basis of the extensive work accumulated in the literature about this proof method. Along this line of research we envisage a bright future for the field and point out promising directions for future research.

  • Katalin Bimbó (University of Alberta, Canada) (TABLEAUX/FroCoS/ITP)

    Title: The perimeter of decidability (with sequent calculi on the inside)

    Abstract: Sequent calculi are preeminently capable of controlling the shape of proofs in a logic. Sometimes this allows decidability to be proved. However, formulating certain intensional logics as sequent calculi creates challenges. I will start with sequent calculi for implicational ticket entailment, and highlight some of the key ideas behind a well-behaved sequent calculus, which was (partly) inspired by structurally free logics. The decidability of implicational ticket entailment was an open problem for about 50 years. I will outline a solution using sequent calculi (from Bimbo & Dunn 2012 and 2013).

    The decidability proof of pure relevant implication (Kripke 1959) can be (and has been) utilized differently (than for implicational ticket entailment). I will focus on adding modalities, lattice connectives and structural rules (both in unrestricted and limited forms). Many of the resulting logics are not among the well-known normal modal logics. I will show that certain ways of adding modalities keep the logic decidable. Moreover, the Curry-Kripke method (possibly, with some additions) still can be used to prove their decidability.

  • Jasmin Blanchette (Vrije Universiteit Amsterdam, The Netherlands) (TABLEAUX/FroCoS/ITP)

    Title: Foundational (Co)datatypes and (Co)recursion for Higher-Order Logic
    Joint work with Julian Biendarra, Aymeric Bouzy, Martin Desharnais, Mathias Fleury, Johannes Hölzl, Ondřej Kunčar, Andreas Lochbihler, Fabian Meier, Lorenz Panny, Andrei Popescu, Christian Sternagel, René Thiemann, and Dmitriy Traytel

    Abstract: We describe a line of work that started in 2011 towards enriching Isabelle/HOL's language with coinductive datatypes, which allow infinite values, and with a more expressive notion of inductive datatype than previously supported by any system based on higher-order logic. These (co)datatypes are complemented by definitional principles for (co)recursive functions and reasoning principles for (co)induction. In contrast with other systems offering codatatypes, no additional axioms or logic extensions are necessary with our approach.

  • Reiner Hähnle (Technische Universität Darmstadt, Germany) (TABLEAUX anniversary session)

    Title: Locally Abstract, Globally Concrete Semantics of Concurrent Programming Languages

    Abstract: A formal, mathematically precise semantics for a programming language is the essential prerequisite for the design of logics and calculi that permit automated reasoning about programs. The most popular approach to programming language semantics — small step operational semantics (SOS) — is not modular in the sense that it does not separate conceptual layers in the target language. SOS is also hard to relate formally to program logics and calculi. Low-level semantic formalisms, such as automata, Petri nets, or π-calculus are inadequate for rich programming languages. We propose a new formal semantics for a concurrent, active objects language. It is designed with the explicit aim of being compatible with a sequent calculus for a program logic and has a strong model theoretic flavor. Our semantics separates sequential and object-local from concurrent computation: the former yields abstract traces which in a second stage are combined into global system behavior.

  • Cezary Kaliszyk (Universität Innsbruck, Austria) (TABLEAUX/FroCoS/ITP)

    Title: Automating Formalization by Statistical and Semantic Parsing of Mathematics

    Abstract: We discuss the progress in our project which aims to automate formalization by combining natural language processing with deep semantic understanding of mathematical expressions. We introduce the overall motivation and ideas behind this project, and then propose a context-based parsing approach that combines efficient statistical learning of deep parse trees with their semantic pruning by type checking and large-theory automated theorem proving. We show that our learning method allows efficient use of large amount of contextual information, which in turn significantly boosts the precision of the statistical parsing and also makes it more efficient. This leads to a large improvement of our first results in parsing theorems from the Flyspeck corpus.

  • Federal Prosecution Office

    Submission Details

    Submissions are invited in two categories:

    • Research papers, which describe original theoretical research, original algorithms, or applications, with length up to 15 pages.
    • System descriptions, with length up to 9 pages.

    Submissions will be reviewed by the PC, possibly with the help of external reviewers, taking into account readability, relevance and originality.

    For category A, theoretical results and algorithms must be original, and not submitted for publication elsewhere. Submissions will be reviewed taking into account correctness, theoretical elegance, and possible implementability.

    For category B submissions, a working implementation must be accessible via the internet, which includes sources. The aim of a system description is to make the system available in such a way that users can use it, understand it, and build on it.

    Accepted papers in both categories will be published in the conference proceedings. Papers must be edited in LaTeX using the llncs style and must be submitted electronically as PDF files via the EasyChair system:


    For all accepted papers at least one author is required to attend the conference and present the paper. A paper title and a short abstract of about 100 words must be submitted before the paper submission deadline. Formatting instructions and the LNCS style files can be obtained at:


    Catholic Cathedral

    Important Dates

  • 18 Apr 2017
    28 Apr 2017 (AoE): Abstract submission (extended)
  • 25 Apr 2017
    28 Apr 2017: Paper submission (extended)
    1 May 2017 (AoE): Paper submission (extended)
  • 8 Jun 2017
    5 Jun 2017: Notification of paper decisions
  • 3 Jul 2017 7 Jul 2017: Camera-ready papers due
  • 23-25 Sep 2017: Workshops & Tutorials
  • 25-28 Sep 2017: TABLEAUX Conference
  • National Museum

    Best Paper Award

    The TABLEAUX 2017 Best Paper Award will be presented to the best submission nominated and chosen by the Program Committee among the accepted papers. The eligibility criteria will place emphasis on the originality and significance of the contribution, but readability and the overall technical quality, including correctness and completeness of results, will be also considered. The TABLEAUX Best Paper Award was established in 2015 and it is a permanent initiative of TABLEAUX.

    The award will be announced and presented at the TABLEAUX 2017 conference.

    Itamaraty Palace

    Program Committee

    Peter Baumgartner (National ICT Australia, Australia)
    Maria Paola Bonacina (Università degli Studi di Verona, Italy)
    Laura Bozzelli (Universidad Politécnica de Madrid, Spain)
    Torben Braüner (Roskilde University, Denmark)
    Serenella Cerrito (Ibisc,Université d'Evry Val d'Essonne, France)
    Agata Ciabattoni (Technische Universität Wien, Austria)
    Clare Dixon (University of Liverpool, UK)
    Pascal Fontaine (LORIA, INRIA, Université de Lorraine, France)
    Didier Galmiche (LORIA,Université de Lorraine, France)
    Martin Giese (Universitetet i Oslo, Norway)
    Laura Giordano (DISIT, Università del Piemonte Orientale, Italy)
    Rajeev Goré (The Australian National University, Australia)
    Volker Haarslev (Concordia University, Canada)
    George Metcalfe (Universität Bern, Switzerland)
    Angelo Montanari (Università degli Studi di Udine, Italy)
    Barbara Morawska (Technische Universität Dresden, Germany)
    Boris Motik (University of Oxford, UK)
    Leonardo de Moura (Microsoft Research, USA)
    Neil Murray (SUNY at Albany, USA)
    Cláudia Nalon (Universidade de Brasília, Brazil) (Co-Chair)
    Linh Anh Nguyen (Uniwersytet Warszawski, Poland)
    Hans de Nivelle (Uniwersytet Wrocławski, Poland)
    Nicola Olivetti (LSIS, Aix-Marseille Université, France)
    Jens Otten (Universitetet i Oslo, Norway)
    Valeria de Paiva (Nuance Communications, USA)
    Nicolas Peltier (CNRS, Laboratoire d'Informatique de Grenoble, France)
    Elaine Pimentel (Universidade Federal Rio Grande do Norte, Brazil)
    Giselle Reis (Carnegie Mellon University-Qatar, Qatar)
    Philipp Ruemmer (Uppsala Universitet, Sweden)
    Katsuhiko Sano (Hokkaido University, Japan)
    Renate Schmidt (The University of Manchester, UK) (Co-Chair)
    Cesare Tinelli (The University of Iowa, USA)
    Alwen Tiu (Nanyang Technological University, Singapore)
    David Toman (University of Waterloo, Canada)
    Josef Urban (České vysoké učení technické v Praze, Czech Republic)
    Itamaraty Palace


    The conference is organised by the Departments of Computer Science and Mathematics at the University of Brasília and by the Departments of Informatics and Applied Mathematics and Mathematics at the Federal University of Rio Grande do Norte.

    Organising Committee:

  • Cláudia Nalon (CIC/UnB)
  • Daniele Nantes Sobrinho (MAT/UnB)
  • Elaine Pimentel (DMAT/UFRN)
  • João Marcos (DIMAp/UFRN)
  • Itamaraty Palace

    Co-located Events


  • 12th Logical and Semantic Frameworks with Applications (LSFA 2017)
    Sandra Alves, Renata Wassermann, Flávio L. C. de Moura
    23 and 24 September 2017
  • Proof eXchange for Theorem Proving (PxTP)
    Catherine Dubois, Bruno Woltzenlogel Paleo
    23 and 24 September 2017
  • EPS - Encyclopedia of Proof Systems
    Giselle Reis, Bruno Woltzenlogel Paleo
    24 and 25 September 2017
  • DaLí – Dynamic Logic: new trends and applications
    Mário Benevides, Alexandre Madeira
    24 September 2017
  • Tutorials:

  • Proof compressions and the conjecture NP = PSPACE
    Lew Gordeev, Edward Hermann Haeusler
    23 September 2017
  • General methods in proof theory for modal and substructural logics
    Björn Lellmann, Revantha Ramanayake
    24 September 2017
  • From proof systems to complexity bounds
    Anupam Das
    25 September 2017
  • PVS for Computer Scientists
    César Muñoz, Mauricio Ayala-Rincón, Mariano Moscato
    25 September 2017
  • Paranoá Lake

    Call for Posters

    TABLEAUX/FroCoS/ITP 2017 will have a poster session, which is intended for descriptions of works in progress, student projects and relevant research being published elsewhere. Submissions should be in English, in the form of at most two pages abstract, ENTCS format containing title and authors name with affiliation. The files should be sent directly to Elaine Pimentel (elaine at mat.ufrn.br).

    The deadline for posters submission is June 15 June 20, 2017. The notification will be sent to authors June 30th.

    Proceedings of this session will not be published. Formatting instructions for posters will be made available soon.

    For more information please contact the local organizers:

  • Elaine Pimentel (elaine at mat.ufrn.br)
  • Daniele Nantes (dnantes at mat.unb.br)
  • Brasilia at night

    Grants and Financial Support

    Association for Symbolic Logic

    TABLEAUX 2017, FroCoS 2017, and ITP 2017 are officially supported by the Association for Symbolic Logic. Students who are ASL members can apply for (limited) ASL travel funds. Applications should be sent three months prior to the start of the events. For full instructions, visit the ASL Travel Awards page.


    ACM-W provides support for women undergraduate and graduate students in Computer Science and related programs to attend research conferences. It is not required to have a paper to present at the conferences. Applications for conferences which are held in September should be sent until 15 June. Please note that this deadline is strict. For full instructions, please visit their scholarship page.

    Chancellery Building - UnB

    Call for Workshop/Tutorials:

    Following the long tradition of TABLEAUX, FroCoS, and ITP, we invite researchers and practitioners to submit proposals for co-located workshops and in-depth tutorials on topics relating to automated theorem proving and its applications. Workshops/tutorials can target the automated reasoning community in general, focus on a particular theorem proving system, or highlight more specific issues or recent developments.

    Co-located events will take place between 23 and 24/25 September and will be held on the same premises as the main conference. Conference facilities are offered free of charge to the organisers. Workshop/tutorial-only attendees will enjoy a significantly reduced registration fee.

    Detailed organisational matters such as paper submission and review process, or publication of proceedings, are up to the organisers of individual workshops. All accepted workshops/tutorials will be expected to have their program ready by 18 August 2017.

    Proposals for workshops/tutorials should contain at least the following pieces of information:

  • name and contact details of the main organiser(s)
  • (if applicable:) names of additional organisers
  • title and organisational style of event (tutorial, public workshop, project workshop, etc.)
  • preferred length of workshop (between half day and two days)
  • estimated number of attendees
  • short (up to one page) description of topic
  • (if applicable:) pointers to previous editions of the workshop, or to similar events
  • Proposals are invited to be submitted by email to nalon@unb.br, no later than 9 December 2016. Selected events will be notified by 23 December 2016. The workshop/tutorial selection committee consists of the TABLEAUX, FroCoS, and ITP program chairs and the conference organisers.

    Brasilia at night (Copyright by Nasa)

    Designed by Mangasanta Arte e Design. Maintained by Cláudia Nalon. Last Updated: