TABLEAUX 2017 - 26th International Conference on Automated Reasoning with Analytic Tableaux and Related Methods

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-29 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).
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.