Automated Reasoning with Analytic Tableaux and Related Methods  32nd International Conference, TABLEAUX 2023, Prague, Czech Republic, September 18–21, 2023, Proceedings /  [electronic resource] : 
edited by Revantha Ramanayake, Josef Urban. 
 - 1st ed. 2023. 
 - XXV, 482 p. 370 illus., 12 illus. in color.  online resource. 
 - Lecture Notes in Artificial Intelligence,  14278  2945-9141 ; .
 - Lecture Notes in Artificial Intelligence,  14278 .
<br/><br/>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. 
<br/><br/> Open Access 
<br/><br/> This open access book constitutes the proceedings of the 32nd International Conference, TABLEAUX 2023, held in Prague, Czech Republic, during September 18–21, 2023. 
<br/><br/><label>ISBN: </label>9783031435133 
<br/><br/><label>Standard No.: </label>10.1007/978-3-031-43513-3  doi 
<br/><br/><label>Subjects--Topical Terms: </label><br/>Artificial intelligence.<br/>Machine theory.<br/>Computer science.<br/>Software engineering.<br/>Computer systems.<br/>Microprogramming .<br/>Artificial Intelligence.<br/>Formal Languages and Automata Theory.<br/>Computer Science Logic and Foundations of Programming.<br/>Software Engineering.<br/>Computer System Implementation.<br/>Control Structures and Microprogramming.
<br/><br/><label>LC Class. No.: </label>Q334-342 TA347.A78 
<br/><br/><label>Dewey Class. No.: </label>006.3