Description

Book Synopsis

This open access book constitutes the proceedings of the proceedings of the 32nd International Conference on Automated Reasoning with Analytic Tableaux and Related Methods, TABLEAUX 2023, held in Prague, Czech Republic, during September 18-21, 2023.

The 20 full papers and 5 short papers included in this book together with 5 abstracts of invited talks were carefully reviewed and selected from 43 submissions.
They present research on all aspects of the mechanization of reasoning with tableaux and related methods. The papers are organized in the following topical sections: tableau calculi; sequent calculi; theorem proving; non-wellfounded proofs; modal logics; linear logic and MV-algebras; separation logic; and first-order logics.




Table of Contents

Range-Restricted and Horn Interpolation through Clausal Tableaux.- Non-Classical Logics in Satisfiability Modulo Theories.- DefTab: A Tableaux System for Sceptical Consequence in Default Modal Logics.- Non-distributive description logic.- A new calculus for intuitionistic Strong L\"ob logic: strong termination and cut-elimination, formalized.- Some Analytic Systems of Rules.- A cut-free, sound and complete Russellian theory of definite descriptions.- Towards Proof-Theoretic Formulation of the General Theory of Term-Forming Operators.- Lemmas: Generation, Selection, Application.- Machine-Learned Premise Selection for Lean.- gym-saturation: Gymnasium environments for saturation provers (System description).- A linear perspective on cut-elimination for non-wellfounded sequent calculi with least and greatest fixed points.- Ill-founded Proof Systems For Intuitionistic Linear-time Temporal Logic.- Proof Systems for the Modal $\mu$-Calculus Obtained by Determinizing Automata.- Extensions of K5: Proof Theory and Uniform Lyndon Interpolation.- On intuitionistic diamonds (and lack thereof).- NP Complexity for Combinations of Non-Normal Modal Logics.- Resolution-based Calculi for Non-Normal Modal Logics.- Canonicity of Proofs in Constructive Modal Logic.- Proof-theoretic Semantics for Intuitionistic Multiplicative Linear Logic.- The MaxSAT problem in the real-valued MV-algebra.- The Logic of Separation Logic: Models and Proofs.- Testing the Satisfiability of Formulas in Separation Logic with Permissions.- Nested Sequents for Quantified Modal Logics.- A Naive Prover for First-Order Logic: A Minimal Example of Analytic Completeness.

Automated Reasoning with Analytic Tableaux and

Product form

£31.49

Includes FREE delivery

RRP £34.99 – you save £3.50 (10%)

Order before 4pm today for delivery by Sat 24 Jan 2026.

A Paperback / softback by Revantha Ramanayake, Josef Urban

1 in stock


    View other formats and editions of Automated Reasoning with Analytic Tableaux and by Revantha Ramanayake

    Publisher: Springer International Publishing AG
    Publication Date: 14/09/2023
    ISBN13: 9783031435126, 978-3031435126
    ISBN10: 3031435125

    Description

    Book Synopsis

    This open access book constitutes the proceedings of the proceedings of the 32nd International Conference on Automated Reasoning with Analytic Tableaux and Related Methods, TABLEAUX 2023, held in Prague, Czech Republic, during September 18-21, 2023.

    The 20 full papers and 5 short papers included in this book together with 5 abstracts of invited talks were carefully reviewed and selected from 43 submissions.
    They present research on all aspects of the mechanization of reasoning with tableaux and related methods. The papers are organized in the following topical sections: tableau calculi; sequent calculi; theorem proving; non-wellfounded proofs; modal logics; linear logic and MV-algebras; separation logic; and first-order logics.




    Table of Contents

    Range-Restricted and Horn Interpolation through Clausal Tableaux.- Non-Classical Logics in Satisfiability Modulo Theories.- DefTab: A Tableaux System for Sceptical Consequence in Default Modal Logics.- Non-distributive description logic.- A new calculus for intuitionistic Strong L\"ob logic: strong termination and cut-elimination, formalized.- Some Analytic Systems of Rules.- A cut-free, sound and complete Russellian theory of definite descriptions.- Towards Proof-Theoretic Formulation of the General Theory of Term-Forming Operators.- Lemmas: Generation, Selection, Application.- Machine-Learned Premise Selection for Lean.- gym-saturation: Gymnasium environments for saturation provers (System description).- A linear perspective on cut-elimination for non-wellfounded sequent calculi with least and greatest fixed points.- Ill-founded Proof Systems For Intuitionistic Linear-time Temporal Logic.- Proof Systems for the Modal $\mu$-Calculus Obtained by Determinizing Automata.- Extensions of K5: Proof Theory and Uniform Lyndon Interpolation.- On intuitionistic diamonds (and lack thereof).- NP Complexity for Combinations of Non-Normal Modal Logics.- Resolution-based Calculi for Non-Normal Modal Logics.- Canonicity of Proofs in Constructive Modal Logic.- Proof-theoretic Semantics for Intuitionistic Multiplicative Linear Logic.- The MaxSAT problem in the real-valued MV-algebra.- The Logic of Separation Logic: Models and Proofs.- Testing the Satisfiability of Formulas in Separation Logic with Permissions.- Nested Sequents for Quantified Modal Logics.- A Naive Prover for First-Order Logic: A Minimal Example of Analytic Completeness.

    Recently viewed products

    © 2026 Book Curl

      • American Express
      • Apple Pay
      • Diners Club
      • Discover
      • Google Pay
      • Maestro
      • Mastercard
      • PayPal
      • Shop Pay
      • Union Pay
      • Visa

      Login

      Forgot your password?

      Don't have an account yet?
      Create account