TABLEAUX 2021

General Information

The 30^th International Conference on Automated Reasoning with Analytic Tableaux and Related Methods (TABLEAUX 2021) will be hosted by the University of Birmingham, UK, 6-9 September 2021. It will primarily be a virtual conference, due to ongoing conerns about COVID-19. However it will be possible to attend the conference physically for those who are able to travel to Birmingham and take advantage of a hybrid format. More information can be found here.

TABLEAUX is the main international conference at which research on all aspects -- theoretical foundations, implementation techniques, systems development and applications -- 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 (sometimes as a part of IJCAR).

TABLEAUX 2021 will be co-located with the 13^th International Symposium on Frontiers of Combining Systems (FroCoS 2021). The conferences will provide a rich programme of workshops, tutorials, invited talks, paper presentations and system descriptions.

Scope of conference

Tableaux and other proof based methods offer convenient and flexible tools for automated reasoning for both classical and non-classical logics. 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, linear, substructural, relevance, non-monotonic logics) and their proof-theoretic foundations;
• related methods (SMT, model elimination, model checking, connection methods, resolution, BDDs, translation approaches);
• sequent, natural deduction, labelled, nested and deep 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 TABLEAUX community and should focus on the role of reasoning, and logical aspects of the solution.

Invited Speakers

TABLEAUX 2021 will host the following invited speakers:

Michael Benedikt (University of Oxford, UK). Joint with FroCoS.
Orna Kupferman (Hebrew University, Israel).
Revantha Ramanayake (University of Gröningen, The Netherlands).
Greg Restall (University of Melbourne, Australia / University of St Andrews, UK).
Renate Schmidt (University of Manchester, UK). Joint with FroCoS.

Submission Guidelines

The submission deadline has now passed.

Submissions are invited in two categories:

• research papers, which describe original theoretical research or applications, with length up to 15 pages excluding references;
• system descriptions, with length up to 9 pages excluding references.

There will also be a later call inviting position papers and brief reports on work-in-progress. Details will be kept up to date on the website.

Submissions will be reviewed by the PC, possibly with the help of external reviewers, taking into account readability, relevance and originality. Any additional material (going beyond the page limit) can be included in a clearly marked appendix, which will be read at the discretion of the committee and must be removed for the camera-ready version.

For category (A) submissions, the reported results must be original and not submitted for publication elsewhere. For category (B) submissions, a working implementation must be accessible via the internet. Authors are encouraged to publish the implementation under an open source license. The aim of a system description is to make the system available in such a way that people can use it, understand it, and build on it. Accepted papers in categories (A) and (B) 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:
https://easychair.org/conferences/?conf=tableaux21.

For all accepted papers at least one author is required to register to the conference and present the paper. A 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.

Accepted Papers

Please consult the Program: all Contributed Talks have been accepted for publication in the proceedings of TABLEAUX 2021.

Important Dates

• Abstract submission: 19 April 2021 26 April 2021 AoE (extended)
• Paper submission: 26 April 2021 30 April 2021 AoE (extended)
• Notification: 14 June 2021
• Conference: 6-9 September 2021

Best Paper Awards

The program committee has made the following awards:

• Best Paper. Stepan Kuznetsov. Complexity of a fragment of infinitary action logic with exponential via non-well-founded proofs.
• Best Paper by a Junior Researcher. Jan Rooduijn. Cyclic hypersequent calculi for some modal logics with the master modality.

Both awards will be presented during the conference.

Workshops and Tutorials

We are pleased to announce that TABLEAUX and FroCoS will host two workshops during the conference week. (Unfortunately both workshops have been cancelled due to organisational difficulties during the COVID-19 pandemic).

Trends in Arithmetic Theories. (Organised by Dmitry Chistikov and Chistophe Haase).

Automated Reasoning in Quantified Non-Classical Logics (ARQNL 2021). (Webpage. Organised by Christoph Benzmüller and Jens Otten).

Registration

TABLEAUX and FroCoS will be entirely free-of-charge to attend, but registration is mandatory to fully engage with the scientific program. We may choose to also stream talks publicly (with no need for registration), but this will be confirmed at a later date.

The registration form is here.

If you wish to attend physically, you should indicate it on the registration form by 13 August at the latest. Note that you are able to edit this response in case of change of circumstances. More information about the conference format will be updated here.

Venue

All talks will be hosted by the Zoom video-conferencing platform, and Breaks and social events will be hosted by Gather. Details for both are made available to registered participants (registration is free).

For those attending TABLEAUX and/or FroCoS 2021 physically, the scientific program will take place at the School of Computer Science, University of Birmingham, in room LG23 (lower ground floor):

Program

Below is the program for TABLEAUX 2021 (updated 1/9/21). There will be no parallel sessions, and the conference will run from the morning of Monday 6 September until the morning of Thursday 9 September, after which it will be directly followed by FroCoS 2021.

All times given are British Summer Time.

All talks will be hosted by the Zoom conferencing platform, and all Breaks and social events will take place on Gather. (Virtual) participation details for talks, breaks and social events will be made available to registered participants.

Monday 6 September

09:00 - 10:00.	Welcome and Registration.
10:00 - 10:30.	Break.
	Contributed Talks: Tableau Calculi. (Chair: Rajeev Goré)
10:30 - 10:50.	Thomas Ferguson	Tableaux and Restricted Quantification for Systems Related to Weak Kleene Logic.
10:50 - 11:10.	Marta Bilkova, Sabine Frittella and Daniil Kozhemiachenko.	Constraint tableaux for two-dimensional fuzzy logics.
11:10 - 11:30.	Nils Kürbis.	Proof-Theory and Semantics for a Theory of Definite Descriptions.
11:30 - 11:50.	Andrzej Indrzejczak and Michal Zawidzki.	Tableaux for Free Logics with Descriptions.
11:50 - 14:00.	Break.
	Invited Talk. (Chair: Sara Negri)
14:00 - 15:00.	Greg Restall.	Comparing Rules for Identity in Sequent Systems and Natural Deduction.
15:00 - 15:30.	Break.
	Contributed Talks: Sequent Calculi. (Chair: Elaine Pimentel)
15:30 - 15:50.	Lukas Grätz.	Analytic Tableaux for Non-Deterministic Semantics.
15:50 - 16:10.	Arnon Avron.	Basing Sequent Systems on Exclusive Or.
16:10 - 16:30.	Vitor Greati, Sérgio Marcelino and João Marcos.	Proof Search on Bilateralist Judgments over Non-deterministic Semantics.
16:30 - 16:50.	Bjoern Lellmann.	From Input/Output Logics to Conditional Logics via Sequents - With Provers.
17:00 - 18:30.	Welcome Social.

Tuesday 7 September

	Invited Talk. (Chair: Arnon Avron)
09:00 - 10:00.	Revantha Ramanayake.	The Barter Trade in Structure and Cuts.
10:00 - 10:30.	Break.
	Contributed Talks: Intuitionistic Modal Logics. (Chair: Sonia Marin)
10:30 - 10:50.	Tiziano Dalmonte, Charles Grellois and Nicola Olivetti.	Terminating Calculi and Countermodels for Constructive Modal Logics.
10:50 - 11:10.	Tim Lyon.	Nested Sequents for Intuitionistic Modal Logics via Structural Refinement.
11:10 - 11:30.	Matteo Acclavio, Davide Catta and Lutz Straßburger.	Game Semantics for Constructive Modal Logic.
11:30 - 11:50.	Michael Mendler, Stephan Scheele and Luke Burke.	The Došen Square under construction: A tale of four modalities.
11:50 - 14:00.	Break.
	Awards. (Chair: Anupam Das)
14:00 - 14:25.	Jan Rooduijn.	Cyclic Hypersequent Calculi for Some Modal Logics with the Master Modality. Best Paper by Junior Researcher(s).
14:30 - 14:55.	Stepan Kuznetsov.	Complexity of a Fragment of Infinitary Action Logic with Exponential via Non-Well-Founded Proofs. Best Paper.
15:00 - 15:30.	Break.
	Contributed Talks: Non-wellfounded Proofs and Theorem Proving I. (Chair: Reuben Rowe)
15:30 - 15:50.	Bahareh Afshari, Graham Leigh and Guillermo Menéndez Turata.	Uniform Interpolation from Cyclic Proofs: the Case of Modal Mu-Calculus.
15:50 - 16:10.	Johannes Marti and Yde Venema.	A Focus System for the Alternation-Free Mu-Calculus.
16:10 - 16:30.	Jens Otten.	The nanoCoP 2.0 Connection Provers for Classical, Intuitionistic and Modal Logics.
16:30 - 16:50.	Zsolt Zombori, Josef Urban and Miroslav Olsak.	The Role of Entropy in Guiding a Connection Prover.
17:30 - 18:30.	Business Meeting.

Wednesday 8 September

	Invited Talk. (Chair: Serenella Cerrito)
09:00 - 10:00.	Orna Kupferman.	Rational Synthesis.
10:00 - 10:30.	Break.
	Contributed Talks: Formalized Proofs and Theorem Proving II. (Chair: Hans de Nivelle)
10:30 - 10:50.	Caitlin D'Abrera, Jeremy Dawson and Rajeev Goré.	A Formally Verified Cut-Elimination Procedure for Linear Nested Sequents for Tense Logic.
10:50 - 11:10.	Rajeev Goré, Revantha Ramanayake and Ian Shillito.	Cut-Elimination for Provability Logic by Terminating Proof Search: Formalised and Deconstructed Using Coq.
11:10 - 11:30.	Rajeev Goré and Cormac Kikkert.	CEGAR-Tableaux: improved modal satisfiability via modal clause-learning and SAT.
11:30 - 11:50.	Michael Rawson and Giles Reger.	lazyCoP: Lazy Paramodulation meets Neurally Guided Search.
11:50 - 14:00.	Break.
	Invited Talk. Joint with FroCoS. (Chair: Andrei Popescu)
14:00 - 15:00.	Michael Benedikt.	The Strange Career of Interpolation and Definability.
15:00 - 15:30.	Break.
	Contributed Talks: Theorem Proving III. (Chair: Jens Otten)
15:30 - 15:50.	André Duarte and Konstantin Korovin.	AC Simplifications and Closure Redundancies in the Superposition Calculus.
15:50 - 16:10.	Michael Rawson and Giles Reger.	Eliminating Models during Model Elimination.
16:10 - 16:30.	Karel Chvalovský, Jan Jakubuv, Miroslav Olšák and Josef Urban.	Learning Theorem Proving Components.
16:30 - 16:50.	Zsolt Zombori, Adrián Csiszárik, Henryk Michalewski, Cezary Kaliszyk and Josef Urban.	Towards Finding Longer Proofs.
17:00 - 18:30.	Joint Social with FroCoS.

Thursday 9 September

	Invited Talk. Joint with FroCoS. (Chair: Giles Reger)
09:00 - 10:00.	Renate A. Schmidt.	Forgetting and Subontology Generation for the Medical Ontology SNOMED CT.
10:00 - 10:30.	Break.

Program Committee

Bahareh Afshari (University of Amsterdam, Netherlands, and University of Gothenburg, Sweden)
Carlos Areces (Universidad Nacional de Córdoba, Argentina)
Arnon Avron (Tel-Aviv University, Israel)
Nick Bezhanishvili (University of Amsterdam, Netherlands)
Patrick Blackburn (University of Roskilde, Denmark)
Serenella Cerrito (Université Paris-Saclay, Univ Evry, France)
Kaustuv Chaudhuri (Inria, France)
Liron Cohen (Ben-Gurion University, Israel)
Anupam Das (University of Birmingham, UK)
Stéphane Demri (CNRS, France)
Hans de Nivelle (Nazarbayev University, Kazakhstan)
Valeria de Paiva (Topos Institute Berkeley, USA)
Clare Dixon (University of Manchester, UK)
Christian Fermüller (TU Wien, Austria)
Didier Galmiche (Université de Lorraine, France)
Silvio Ghilardi (Università degli Studi di Milano, Italy)
Rajeev Goré (Australian National University, Australia)
Andrzej Indrzejczak (University of Łódź, Poland)
Hidenori Kurokawa (Kanazawa University, Japan)
Stepan Kuznetsov (Russian Academy of Sciences, Russia)
Björn Lellmann (SBA Research, Austria)
Stéphane Graham-Lengrand (SRI International, USA)
George Metcalfe (University of Bern, Switzerland)
Neil Murray (University At Albany, USA)
Cláudia Nalon (Universidade de Brasília, Brazil)
Sara Negri (University of Genoa, Italy)
Nicola Olivetti (Aix-Marseille University, France)
Eugenio Orlandelli (University of Bologna, Italy)
Jens Otten (University of Oslo, Norway)
Alessandra Palmigiano (Vrije Universiteit Amsterdam, Netherlands)
Dirk Pattinson (Australian National University, Australia)
Frank Pfenning (Carnegie Mellon University, USA)
Elaine Pimentel (Federal University of Rio Grande do Norte, Brazil)
Andrei Popescu (University of Sheffield, UK)
Gian Luca Pozzato (University of Turin, Italy)
Giselle Reis (Carnegie Mellon University, Qatar)
Reuben Rowe (Royal Holloway, UK)
José Espírito Santo (University of Minho, Portugal)
Lutz Straßburger (Inria, France)
Josef Urban (Czech Technical University in Prague, Czech Republic)

PC Chairs

Anupam Das (University of Birmingham, UK)
Sara Negri (University of Genoa, Italy)

Local Organisation

Kate Campbell
Gianluca Curzi
Anupam Das
Marianna Girlando
Suman Khan
Sonia Marin

Contact

Any queries should be sent by email to tableaux21@easychair.org.

Sponsorship and support