The 28th International Conference on Automated Reasoning with Analytic Tableaux and Related Methods will take place in London. It will be hosted by the Department of Computer Science at the Middlesex University London, on 3-5 September 2019.

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 organized on an annual basis; in 2001, 2004, 2006, 2008, 2010, 2012, 2014, 2016 and 2018 as a constituent of IJCAR.

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

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

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, fuzzy, relevance and non-monotonic logics) and their proof-theoretic foundations
sequent calculi and natural deduction 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 tableau community and should focus on the role of reasoning and on logical aspects of the solution.

HOME