Automated Reasoning with Analytic Tableaux and Related Methods : 32nd International Conference, TABLEAUX 2023, Prague, Czech Republic, September 18-21, 2023, Proceedings (Lecture Notes in Computer Science)

個数：

Automated Reasoning with Analytic Tableaux and Related Methods : 32nd International Conference, TABLEAUX 2023, Prague, Czech Republic, September 18-21, 2023, Proceedings (Lecture Notes in Computer Science)

Ramanayake, Revantha (EDT)/ Urban, Josef (EDT)

ウェブストア価格 ¥10,417（本体¥9,470）
Springer International Publishing AG（2023/09発売）
外貨定価 US$ 49.99
ポイント 94pt

オンデマンド(OD/POD)版です。キャンセルは承れません。

【入荷遅延について】
世界情勢の影響により、海外からお取り寄せとなる洋書・洋古書の入荷が、表示している標準的な納期よりも遅延する場合がございます。
おそれいりますが、あらかじめご了承くださいますようお願い申し上げます。

◆画像の表紙や帯等は実物とは異なる場合があります。

◆ウェブストアでの洋書販売価格は、弊社店舗等での販売価格とは異なります。
また、洋書販売価格は、ご注文確定時点での日本円価格となります。
ご注文確定後に、同じ洋書の販売価格が変動しても、それは反映されません。

製本 Paperback:紙装版/ペーパーバック版／ページ数 482 p.
言語 ENG
商品コード 9783031435126
DDC分類 006.333

Full Description

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.

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.