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.