Automated Reasoning with Analytic Tableaux and Related Methods [electronic resource] : 22nd International Conference, TABLEAUX 2013, Nancy, France, September 16-19, 2013, Proceedings / edited by Didier Galmiche, Dominique Larchey-Wendling.
Material type:
TextLanguage: English Series: Lecture Notes in Computer Science ; 8123Publication details: Berlin, Heidelberg : Springer Berlin Heidelberg, 2013.Description: 1 online resource (X, 289 p. 34 ill.)ISBN: - 9783642405372
| Item type | Current library | Call number | Materials specified | Status | Date due | Barcode | Item holds | |
|---|---|---|---|---|---|---|---|---|
|
|
National Library of India | Available | EBK000024360ENG |
Invited Talks -- Witness Runs for Counter Machines (Abstract) -- On the Duality of Proofs and Countermodels in Labelled Sequent Calculi -- A Brief Survey of Verified Decision Procedures for Equivalence of Regular Expressions -- Research Papers -- Dealing with Symmetries in Modal Tableaux -- Tableaux for Verification of Data-Centric Processes -- Bounded Proofs and Step Frames -- Compression of Propositional Resolution Proofs by Lowering Subproofs -- A Tableau System for Right Propositional Neighborhood Logic over Finite Linear Orders: An Implementation -- Hypersequent and Labelled Calculi for Intermediate Logics -- TATL: Implementation of ATL Tableau-Based Decision Procedure -- A Terminating Evaluation-Driven Variant of G3i -- Model Checking General Linear Temporal Logic -- Semantically Guided Evolution of SHI ABoxes -- Psyche: A Proof-Search Engine Based on Sequent Calculus with an LCF-Style Architecture -- Understanding Resolution Proofs through Herbrand's Theorem -- A Labelled Sequent Calculus for BBI: Proof Theory and Proof Search -- A Refined Tableau Calculus with Controlled Blocking for the Description Logic SHOI -- Prefixed Tableau Systems for Logic of Proofs and Provability -- Correspondence between Modal Hilbert Axioms and Sequent Rules with an Application to S5 -- Schemata of Formulæ in the Theory of Arrays -- TAFA - A Tool for Admissibility in Finite Algebras -- Formalizing Cut Elimination of Coalgebraic Logics in Coq -- Intelligent Tableau Algorithm for DL Reasoning.
There are no comments on this title.
