[Proof Complexity] TABLEAUX 2021 - 2nd Call for Papers. 6-9 September, 2021. Birmingham, UK.

anupamdotdas at gmail.com anupamdotdas at gmail.com
Wed Mar 24 21:10:32 CET 2021


The 30th International Conference on Automated Reasoning with Analytic Tableaux and Related Methods

Birmingham, UK, September 6-9, 2021


Website:  <https://tableaux2021.org/> https://tableaux2021.org/

Submission deadlines: 19 April (abstract), 26 April 2021 (paper) 



The 30th 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.


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 13th 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. 



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, fuzzy, relevance and non-monotonic logics) and their proof-theoretic foundations;

   * sequent, natural deduction, labelled, nested and deep calculi for classical and non-classical logics, as tools for proof search and proof representation;

   * related methods (SMT, model elimination, model checking, connection methods, resolution, BDDs, translation approaches); 

   * 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, proof assistants, logical frameworks, model checkers, etc.); 

   * implementation techniques (data structures, efficient algorithms, performance measurement, extensibility, etc.); 

   * extensions of tableau procedures with conflict-driven learning; 

   * techniques for proof generation and compact (or humanly readable) proof representation;  

   * theoretical and practical aspects of decision 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 on logical aspects of the solution. 



Submissions are invited in the following two categories:  

(A) research papers reporting original theoretical research or applications, with length up to 15 pages excluding references;    

(B) 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: 




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:





Abstract submission: 19 April 2021 (AoE)

Paper submission: 26 April 2021 (AoE)

Notification: 14 June 2021

Conference: 6-9 September 2021



TABLEAUX 2021 and FroCoS 2021 are intended to be *hybrid* conferences welcoming both physical and virtual participation. The organisers are closely monitoring the pandemic situation and may choose to make the conference virtual-only if it seems unreasonable to host any sort of physical event. A final decision will be taken before the notification date 14 June (12 weeks before the conference) to leave ample time for potential travel plans to be made.



The conference proceedings will be published in the Springer series Lecture Notes in Artificial Intelligence (LNAI/LNCS).



The program committee will select 

* the TABLEAUX 2021 Best Paper; and, 

* the TABLEAUX 2021 Best Paper by a Junior Researcher. 


Researchers will be considered "junior" if either they are students or their PhD degree date is less than two years from the first day of the meeting. The two awards will be presented at the conference. 



Some funding may be available to support students participating at TABLEAUX 2021. More details will be given on the conference website in due time. 



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)



Anupam Das (University of Birmingham, UK)

Sara Negri (University of Genoa, Italy)



More information about the Proof-Complexity mailing list