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 are published in the Springer series Lecture Notes in Artificial Intelligence (LNAI/LNCS), volume 10501 and will be freely accessible, as a courtesy of Springer, for registered attendees during the event in the following link:

http://link.springer.com/book/10.1007/978-3-319-66902-1.

Topics

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.

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.

Invited Speakers

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

Title: Tableau Calculus for Hybrid Xpath with Data

Abstract: In many applications, dealing with actual data is an important challenge. For instance, applications which manage large volumes of web or medical data require, in many cases, more complex models than those that can be encoded in classical relational databases. These models are often defined and studied in the context of semi-structured data. A semi-structured data model is based on an organization of data in labeled trees or graphs, and on query languages for accessing and updating these structures. These representations can contain labels coming from a finite alphabet (capturing the structural information), or from an infinite alphabet (capturing also the actual data in the database). XML (eXtensible Markup Language) is the most successful data model that captures both structural information and data, while XPath is, arguably, the most widely used XML query language. XPath is, fundamentally, a general purpose language for addressing, searching, and matching pieces of an XML document. Core-XPath is the fragment of XPath containing the navigational behavior of XPath. It can express properties of the underlying tree structure of the XML document, such as the label of a node, but it cannot express conditions on the actual data contained in the attributes. Without the ability to relate nodes based on the actual data values of the attributes, the expressive power of Core-XPath is inappropriate for many applications. XPath= is the extension of Core-XPath with (in)equality tests between attributes of elements in an XML document.

In this talk I will present a recently developed sound, complete and terminating tableau calculus for XPath= with downward navigation, where node expressions are extended with nominals (special labels that are true in only one node), and path expressions are extended with the satisfaction operator (allowing the navigation to some particular named node). The tableaux is developed following ideas introduced to design terminating tableau calculi for hybrid logics. The main intuition is that nominals and satisfaction operators can be used in tableaux to keep track of the evaluation of a formula during an attempt to build a model. This way, tableaux rules and the completeness proof are more intuitive, obtaining a simple proof theory for XPath with data.

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.

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:

http://easychair.org/conferences/?conf=tableaux2017.

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:

http://www.springer.com/br/computer-science/lncs/conference-proceedings-guidelines.

TABLEAUX 2017 Accepted Papers

Peter Schmitt.
A First-Order Theory of Ordinals

Camillo Fiorentini and Mauro Ferrari.
A Forward Unprovability Calculus for Intuitionistic Propositional Logic

Dmitry Tishkovsky and Renate A. Schmidt.
Rule Refinement for Semantic Tableau Calculi

Ori Lahav and Yoni Zohar.
Cut-Admissibility as a Corollary of the Subformula Property

Serenella Cerrito and Amélie David.
Minimization of ATL* Models

Liron Cohen.
Completeness for Ancestral Logic via a Computationally-Meaningful Semantics

Jeremy Dawson and Rajeev Gore.
Machine-Checked Proof-theory of Ticket Entailment

Christian Fermüller and Timo Lang.
Interpreting Sequent Calculi as Client-Server Games

Peter Baumgartner, Sylvie Thiebaux and Felipe Trevizan.
Tableaux for Policy Synthesis for MDPs with PCTL* Constraints

Marianna Girlando, Bjoern Lellmann, Nicola Olivetti and Gian Luca Pozzato.
Hypersequent Calculi for Lewis Conditional Logics with Uniformity

Reuben Rowe and James Brotherston.
Realizability in Cyclic Proof: Extracting Ordering Information for Infinite Descent

Marianna Girlando, Bjoern Lellmann, Nicola Olivetti, Gian Luca Pozzato and Quentin Vitalis.
VINTE: An Implementation of Internal Calculi for Lewis’ Logics for Counterfactual Reasoning (System Description)

Sonia Marin and Lutz Strassburger.
Proof Theory for Indexed Nested Sequents

Jens Otten.
Non-Clausal Connection Calculi for Non-Classical Logics

Anupam Das and Damien Pous.
A Cut-Free Cyclic Proof System for Kleene Algebra

Sorin Stratulat.
Cyclic Proofs with Ordering Constraints

Lee Barnett.
Goal-Sensitive Reasoning with Disconnection Tableaux

David Cerna and Michael Lettmann.
Integrating a Global Induction Mechanism into a Sequent Calculus

Mateus De Oliveira Oliveira.
Parameterized Provability in Equational Logic

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

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.

Program Committee

Peter Baumgartner (Data61/CSIRO, 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 (Ahmedabad University, India)
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 do Rio Grande do Norte, Brazil)
Giselle Reis (Carnegie Mellon University-Qatar, Qatar)
Philipp Rümmer (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)

Organisation:

The conference is organised by the Departments of Computer Science (CIC) and Mathematics (MAT) at the University of Brasília and by the Departments of Informatics and Applied Mathematics (DIMAp) and Mathematics (DMAT) 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)

Co-located Events

Workshops:

12th Workshop on 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
23 and 24 September 2017

Tutorials:

T1 - Proof compressions and the conjecture NP = PSPACE
Lew Gordeev, Edward Hermann Haeusler
23 September 2017

T2 - General methods in proof theory for modal and substructural logics
Björn Lellmann, Revantha Ramanayake
24 September 2017
Slides: Lecture 1, Lecture 2, Lecture 3,Lecture 4

T3 - From proof systems to complexity bounds
Anupam Das
25 September 2017

T4 - PVS for Computer Scientists
César Muñoz, Mauricio Ayala-Rincón, Mariano Moscato
25 September 2017

Accepted Abstracts: Poster Session

The Poster Session is scheduled for Thursday 28/09 and will be preceded by short talks, which should be at most 5 minutes long. Posters should have the form A1: 594 x 841 mm (23.4 x 33.1 inches - portrait).

Combined Proof Methods For Multimodal K
Daniella Angelos, Cláudia Nalon

Congruence Closure with Free Variables
Haniel Barbosa, Pascal Fontaine, Andrew Reynolds

Conditional Parametricity in Isabelle/HOL
Jan Gilcher, Andreas Lochbihler, Dmitriy Traytel

Mining for Formalization Environments in the Mizar Mathematical Library
Adam Naumowicz

Formal Verification of the Dynamic Authentication Protocol
Felipe Rodopoulos de Oliveira, Cláudia Nalon

On Generalizing Decidable Standard Prefix Classes of First-Order Logic
Marco Voigt

Program Extraction for Mutable Arrays
Kazuhiko Sakaguchi

A resolution-based E-connection calculus
Lucas Amaral, Cláudia Nalon

Automatic Complexity Analysis of Programs
Florian Frohn, Jürgen Giesl

Formal Verification of Smart Contracts
Chad E. Brown, Ondrej Kuncar Josef Urban

Polynomials, rivals of tableaux
Walter Carnielli

Craig Interpolation and Query Reformulation with Clausal First-Order Tableaux
Christoph Wernhard

Mind the Gap: Metric Temporal Logic Translations
Ullrich Hustadt, Clare Dixon, Ana Ozaki

Verified Model Checking of Timed Automata
Simon Wimmer, Peter Lammich

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)

Preliminary Programme for All Events

Keys:
IT = Invited Talk
TP = Technical Presentation
T/F/I = TABLEAUX/FroCoS/ITP
T1-T4 = tutorials

TABLEAUX 2017 Programme

The programme can be downloaded as a pdf file by clicking here.

Monday, 25th of September

Session 1: Opening & TABLEAUX Anniversary Invited Talk
Chair: Jens Otten
14:15 - 14:30	Opening Session
	Renate A. Schmidt and Cláudia Nalon
14:30 - 15:30	A Vision for Automated Deduction Rooted in the Connection Method
	Wolfgang Bibel
	Sponsored by the European Association for Artificial Intelligence (EurAI)
15:30 - 16:00	Coffee Break
Session 2: TABLEAUX Anniversary Invited Talk & TABLEAUX Best Paper Award
Chair: Neil Murray
16:00 - 17:00	Locally Abstract, Globally Concrete Semantics of Concurrent Programming Languages
	Reiner Hähnle
	Sponsored by the European Association for Artificial Intelligence (EurAI)
17:00 - 17:15	TABLEAUX Award
	Renate A. Schmidt
17:15 - 18:00	Anniversary Exhibition Opening
	Cláudia Nalon

Tuesday, 26th of September

ITP Invited Talk
Chair: César Muñoz
08:30 - 09:30	Whitebox Automation
	Leonardo de Moura
Session 3: TABLEAUX Best Paper & Sequent Systems
Chair: Didier Galmiche
09:30 - 10:00	Cut-Admissibility as a Corollary of the Subformula Property
	Ori Lahav and Yoni Zohar
10:00 - 10:30	Proof Theory for Indexed Nested Sequents
	Sonia Marin and Lutz Strassburger
10:30 - 11:00	Coffee Break
Session 4: Transitive Closure & Cyclic Proofs
Chair: Peter Baumgartner
11:00 - 11:30	Integrating a Global Induction Mechanism into a Sequent Calculus
	David Cerna and Michael Lettmann
11:30 - 12:00	Realizability in Cyclic Proof: Extracting Ordering Information for Infinite Descent
	Reuben Rowe and James Brotherston
12:00 - 12:30	Cyclic Proofs with Ordering Constraints
	Sorin Stratulat
12:30 - 14:00	Lunch
Session 5: TABLEAUX Invited Talk & Formalisation
Chair: Pascal Fontaine
14:00 - 15:00	Tableau Calculus for Hybrid Xpath with Data
	Carlos Areces
15:00 - 15:30	A Mechanizable First-Order Theory of Ordinals
	Peter Schmitt
15:30 - 16:00	Coffee Break
Session 6: Tableaux, Temporal Logic & Decidability
Chair: Clare Dixon
16:00 - 16:30	Goal-Sensitive Reasoning with Disconnection Tableaux
	Lee Barnett
16:30 - 17:00	Tableaux for Policy Synthesis for MDPs with PCTL* Constraints
	Peter Baumgartner, Sylvie Thiebaux and Felipe Trevizan
17:00 - 17:30	Minimization of ATL* Models
	Serenella Cerrito and Amélie David
17:30 - 18:00	Parameterized Provability in Equational Logic
	Mateus de Oliveira Oliveira

Wednesday, 27th of September

Session 7: Joint Tableaux/FroCoS/ITP Invited Talk, Transitive Closure & Cyclic Proofs
Chair: Elaine Pimentel
08:30 - 09:30	The Perimeter of Decidability (with Sequent Calculi on the Inside)
	Katalin Bimbó
09:30 - 10:00	Completeness for Ancestral Logic via a Computationally-Meaningful Semantics
	Liron Cohen
10:00 - 10:30	A Cut-Free Cyclic Proof System for Kleene Algebra
	Anupam Das and Damien Pous
10:30 - 11:00	Coffee Break
Session 8: Sequent Systems
Chair: Rajeev Goré
11:00 - 11:30	A Forward Unprovability Calculus for Intuitionistic Propositional Logic
	Camillo Fiorentini and Mauro Ferrari
11:30 - 12:00	VINTE: an Implementation of Internal Calculi for Lewis' Logics for Counterfactual Reasoning
	Marianna Girlando, Björn Lellmann, Nicola Olivetti, Gian Luca Pozzato and Quentin Vitalis
12:00 - 12:30	Hypersequent Calculi for Lewis Conditional Logics with Uniformity
	Marianna Girlando, Björn Lellmann, Nicola Olivetti and Gian Luca Pozzato
12:30 - 14:00	Lunch
Joint Tableaux/FroCoS/ITP Invited Talk
Chair: Amy Felty
14:00 - 15:00	Automating Formalization by Statistical and Semantic Parsing of Mathematics
	Cezary Kaliszyk
Session 9: Sequent Systems (cont'd)
Chair: Serenella Cerrito
15:00 - 15:30	Interpreting Sequent Calculi as Client-Server Games
	Christian Fermüller and Timo Lang
15:30 - 15:45	Coffee Break
15:45 - 22:00	Excursion & Dinner

Thursday, 28th of September

Session 10: FroCoS Invited Talk & Poster Session
Chair: Clare Dixon
08:30 - 09:30	Revising System Specifications in Temporal Logic
	Renata Wassermann
09:30 - 09:45	FLOC 2018 Announcement
	Didier Galmiche, Roberto Sebastiani
09:45 - 10:30	Poster talks
	Renate A. Schmidt
10:30 - 11:00	Coffee Break & Poster Display
11:00 - 12:30	Poster Display
12:30 - 14:00	Lunch
Joint Tableaux/FroCoS/ITP Invited Talk
Chair: Marcelo Finger
14:00 - 15:00	Foundational (Co)Datatypes and (Co)Recursion for Higher-Order Logic
	Jasmin Blanchette
Session 11: Formalisation
Chair: Giselle Reis
15:00 - 15:30	Issues in Machine-Checking the Decidability of Implicational Ticket Entailment
	Jeremy Dawson and Rajeev Goré
15:30 - 16:00	Coffee Break
Session 12: Non-Classical Logics
Chair: Hans de Nivelle
16:00 - 16:30	Non-clausal Connection Calculi for Non-Classical Logics
	Jens Otten
16:30 - 17:00	Rule Refinement for Semantic Tableau Calculi
	Dmitry Tishkovsky and Renate A. Schmidt
17:00 - 18:00	Business Meeting
	Jens Otten, Franz Baader, César Muñoz

Grants and Financial Support

Students Grants

A limited number of travel grants is available for students who would not otherwise have resources to attend TABLEAUX/FroCoS/ITP, and whose attendance would benefit both the applicant and the event. We expect to be able to help with local/travel expenses up to 250 EUR per student. Applicants should note that grants are limited, and that costs in excess of the grant will not be reimbursed.

Grants will be awarded based on the grant committee's assessment of the applicant's genuine financial need, the potential benefit to the applicant's education and research, and the potential benefit to TABLEAUX/FroCoS/ITP. Among those applicants who genuinely could not attend TABLEAUX/FroCoS/ITP without a grant, the evaluating committee gives priority to (co-)authors of accepted papers.

Although priority is given to students with active role in the conferences/workshops, students in other situations are very much encouraged to apply.

Applications should explain briefly (limited to 2000 characters)

• the current status of the applicant
• the kind of participation of the applicant in TABLEAUX/FroCoS/ITP
• a breakdown of the estimated amount needed

Applications should be sent by August 10th 2017 by email to Elaine Pimentel (elaine.pimentel at gmail.com). Students should have their supervisor sent a brief recommendation email (limited to 2000 characters) to the same address and by the same deadline. This letter should describe the student's work, the benefit to that work of attending the conference, and an assessment of the student's financial need.

The award notification date is August 15th, 2017.

The grants will be presented at the conferences; in case a grantee does not attend, the chairs may transfer the grant to another student or give no award.

The grants are offered by Springer and by the organisation of the conferences.

For more information please contact the local organisers:

• Elaine Pimentel (elaine.pimentel at gmail.com)
• Daniele Nantes (daniele.nantes at gmail.com)

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

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.

Registration

The registration page is no longer available (2017-10-18). Early registration is until the 4th August. Late registration until the 2nd September. After that, registration can be done only on the venue at the same prices of late registration, but only payment in cash can be taken. All prices are all given in Brazilian Reals. Regular fees include coffee breaks, lunchs, proceedings of the selected conferences/workshops, and social activities. Student fees include coffee breaks, lunchs, proceedings of the selected conferences/workshops, but do not include social activities (excursion/dinner).

Early Registration (until 4th August 11th August)

Conferences: TABLEAUX, FroCoS, ITP

One conference only: R$ 1065.00 (regular), R$ 760.00 (student)

Any two conferences: R$ 1255.00 (regular), R$ 855.00 (student)

All three conferences: R$ 1445.00 (regular), R$ 950.00 (student)

Workshops:

LSFA 2017: R$ 495.00 (regular), R$ 325.00 (student)

PxTP 2017: R$ 345.00 (regular), R$ 230.00 (student)

EPS: R$ 230.00 (regular), R$ 155.00 (student)

Dalí: R$ 460.00 (regular), R$ 310.00 (student)

Tutorials

Each: R$ 230.00 (regular), R$ 155.00 (student)

Late Registration (until 2nd September)

Conferences: TABLEAUX, FroCoS, ITP

One conference only: R$ 1280.00 (regular), R$ 915.00 R$ 760.00 (student)

Any two conferences: R$ 1510.00 (regular), R$ 1030.00 R$ 855.00 (student)

All three conferences: R$ 1735.00 (regular), R$ 1140.00 R$ 950.00 (student)

Workshops:

LSFA 2017: R$ 595.00 (regular), R$ 390.00 R$ 325.00 (student)

PxTP 2017: R$ 415.00 (regular), R$ 280.00 R$ 230.00 (student)

EPS: R$ 280.00 (regular), 190.00 R$ 155.00 (student)

Dalí: R$ 560.00 (regular), R$ 380.00 R$ 310.00 (student)

Tutorials

Each: R$ 280.00 (regular), R$ 190.00 R$ 155.00 (student)

Extras (any time)

Extra tickets excursion/conference dinner: R$ 380.00

Physical copy of the EPS: R$ 80.00

Venue

All the events will be held at the Finatec building located within the University of Brasília.
Finatec- Fundação de Empreendimentos Científicos e Tecnológicos
Campus Universitário Darcy Ribeiro
Av. L3 Norte, Ed. Finatec
Asa Norte, Brasília – DF
CEP 70910-900
Tel.: +55 61 3348 0400

Local Information:

(This is under construction. Please return for more information.)

Accessibility

Brasília is served by an international airport which handles around 19 million passengers a year. As part of the preparation for hosting the 2014 FIFA World Cup, the airport received massive investments, from both the public and private sectors, for the renovation of the passenger’s terminals and the enlargement of the taxiways, which has allowed to almost double the number of positions available for aircrafts and, thus, increase the number of available routes for both domestic and international flights. International flights directly connect Brasília with Santiago (Chile), Panama City (Panama), Miami (USA), Atlanta (USA), and Lisbon (Portugal).

It is also worthy mentioning that Brasília hosts one of the most important regional hubs in Brazil. There are direct flights from all the state capitals, including Rio de Janeiro, São Paulo, Porto Alegre, Natal, Recife, among other places which are easily accessible directly from other continents and from other countries in the Americas.

Brasília is centrally located and well served by coaches from elsewhere in Brazil, but prices for internal flights are competitive and travel times much shorter.

Transportation

The airport is just 20 minutes away from the centre, where the hotels are. Taxis cost around € 15.00 and are a convenient way to go from and to the airport.

There is also an Executive Bus from the airport to the Hotels Sectors. It runs every half an hour and stops by the door of or conveniently close to the main hotels in these areas. The trip costs R$ 12.00 (around € 2.50).

Regular buses (lines 102, 102.1) also run from the airport to the main bus terminal in town, are frequent and quite cheap (€ 0.50). From the bus terminal you will need to catch another bus or a taxi to get to other places. If you do not speak Portuguese or do not know your way around, this is not recommended for you.

Visa Requirements

Brazil’s foreign policy is based on reciprocity. The Brazilian immigration authority will not require application for a visa prior to travelling/entering the country if your own country does not require such from Brazilian nationals. Nationals of 86 countries can enter Brazil without a visa, including all EU countries. For those who need a visa, there is a special category for attendees of scientific meetings (VITUR), where a letter of invitation is needed. You should check with the Brazilian Consulate in your country what the requirements are. The organisation of the event will provide the required letters upon registration, in case you need them to apply for visas.

Accommodation

Brasília has a vast number of hotels. They are located in the central area, closer to the cross between the Monumental and the Residential Axes, about 10 minutes by car to the events venue.

We have negotiated special rates at the Comfort Suítes Brasília:

Single: R$ 237,00

Double: R$ 280,00

Values are per night, breakfast is included, and taxes are not included (15%). In order to benefit from these rates, you need to contact the hotel directly via email (reservas.csb@atlanticahotels.com.br or eventos.csb@atlanticahotels.com.br) and cite the conferences.

Alternatives can be found at the usual search sites: Booking.com, airbnb, Trip Advisor, etc.

Shuttle Hotels/FINATEC/Social Events

The organisation will provide transportation from the North Hotels Sector (SHN, stop in front of the Comfort Suítes Brasíllia) to the FINATEC Building at the University of Brasília (UnB). The trips between UnB (ICC Norte) and UnB (Finatec) are for registered attendees of the tutorial "PVS for Computer Scientists". We will also provide transportation from the Finatec Building to the Itamaraty Palace, and from there to the APCEF (where the dinner will be held).

• 23/09/17
  • 07:40:00 SHN ↦ UnB (Finatec)
  • 08:15:00 SHN ↦ UnB (Finatec)
  • 17:45:00 UnB (Finatec) ↦ SHN
  • 18:00:00 UnB (Finatec) ↦ SHN
• 24/09/17
  • 07:50:00 SHN ↦ UnB (Finatec)
  • 08:15:00 SHN ↦ UnB (Finatec)
  • 17:00:00 UnB (Finatec) ↦ SHN
  • 17:30:00 UnB (Finatec) ↦ SHN
• 25/09/17
  • 07:40:00 SHN ↦ UnB (Finatec)
  • 08:10:00 UnB (Finatec) ↦UnB (ICC Norte)
  • 11:30:00 SHN ↦ UnB (Finatec)
  • 12:30:00 UnB (ICC Norte) ↦ UnB (Finatec)
  • 13:50:00 UnB (Finatec) ↦UnB (ICC Norte)
  • 17:30:00 UnB (ICC Norte) ↦ UnB (Finatec)
  • 18:00:00 UnB (Finatec) ↦ SHN
  • 18:30:00 UnB (Finatec) ↦ SHN
• 26/09/17
  • 07:30:00 SHN ↦ UnB (Finatec)
  • 08:00:00 SHN ↦ UnB (Finatec)
  • 18:00:00 UnB (Finatec) ↦ SHN
  • 18:30:00 UnB (Finatec) ↦ SHN
• 27/09/17
  • 07:00:00 SHN ↦ UnB (Finatec)
  • 07:30:00 SHN ↦ UnB (Finatec)
  • 08:00:00 SHN ↦ UnB (Finatec)
  • 15:40:00 UnB (Finatec) ↦Itamaraty
  • 16:10:00 UnB (Finatec) ↦ SHN
  • 16:40:00 UnB (Finatec) ↦ Itamaraty
  • 17:00:00 Itamaraty ↦ APCEF
  • 18:00:00 Itamaraty ↦ APCEF
  • 21:00:00 APCEF ↦ SHN
  • 21:30:00 APCEF ↦ SHN
  • 22:00:00 APCEF ↦ SHN
• 28/09/17
  • 07:00:00 SHN ↦ UnB (Finatec)
  • 07:30:00 SHN ↦ UnB (Finatec)
  • 08:00:00 SHN ↦ UnB (Finatec)
  • 17:20:00 UnB (Finatec) ↦ SHN
  • 17:50:00 UnB (Finatec) ↦ SHN
  • 18:30:00 UnB (Finatec) ↦ SHN
• 29/09/17
  • 07:30:00 SHN ↦ UnB (Finatec)
  • 08:00:00 SHN ↦ UnB (Finatec)
  • 17:15:00 UnB (Finatec) ↦ SHN
  • 17:40:00 UnB (Finatec) ↦ SHN

Vaccination

Brazil does not require an International Certificate of Vaccination or Prophylaxis for entry into the country.

Travelers are encouraged, however, to ensure their routine immunizations are up to date (as recommended by their country of origin), since it is an effective and safe measure for the prevention of various diseases.

Brasília is not in the endemic area of yellow fever. However, it is also important that travellers take yellow fever vaccination 10 days before visiting forested areas or participating in ecotourism or rural tourism activities. For further information on yellow fever, please click here.

(source: Brazilian Ministry of Health)

Out and Around

Brasília is a modern, lively place, with a variety of attractions worth seeing. For those who like the urban environment and cultural activities, almost all public buildings are open for visitation, most of them with free guided tours. Besides the architectural features, they hold interesting art collections which are also open for visitation. For the more adventurous, we are in the middle of the Cerrado ecosystem, which makes trips to nearby parks and waterfalls a very pleasant experience. Some of the suggested places to visit include the National parks:

• The Chapada dos Veadeiros National Park
• Corumbá Falls
• The Itiquira Falls

and nearby cities of historical interest:

• Pirenópolis
• Goiás City

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.