Automated Reasoning with Analytic Tableaux and Related Methods [electronic resource] : International Conference, TABLEAUX’98 Oisterwijk, The Netherlands, May 5–8, 1998 Proceedings / edited by Harrie Swart.

Contributor(s): Swart, Harrie [editor.] | SpringerLink (Online service)Material type: TextTextSeries: Lecture Notes in Computer Science ; 1397Publisher: Berlin, Heidelberg : Springer Berlin Heidelberg, 1998Description: X, 325 pp. online resourceContent type: text Media type: computer Carrier type: online resourceISBN: 9783540697787Subject(s): Computer science | Artificial intelligence | Computer Science | Artificial Intelligence (incl. Robotics) | Mathematical Logic and Formal LanguagesAdditional physical formats: Printed edition:: No titleDDC classification: 006.3 LOC classification: Q334-342TJ210.2-211.495Online resources: Click here to access online
Contents:
Extended Abstracts of Invited Lectures -- Philosophical Aspects of Computerized Verification of Mathematics -- A Science of Reasoning (Extended Abstract) -- Model Checking: Historical Perspective and Example (Extended Abstract) -- Comparison -- Comparison of Theorem Provers for Modal Logics — Introduction and Summary -- FaCT and DLP -- Prover KT4 -- leanK 2.0 -- Logics Workbench 1.0 -- Optimised Functional Translation and Resolution -- Benchmark Evaluation of ?KE -- Abstracts of the Tutorials -- Implementation of Propositional Temporal Logics Using BDDs -- Computer Programming as Mathematics in a Programming Language and Proof System CL -- Contributed Research Papers -- A Tableau Calculus for Multimodal Logics and Some (Un)Decidability Results -- Hyper Tableau — The Next Generation -- Fibring Semantic Tableaux -- A Tableau Calculus for Quantifier-Free Set Theoretic Formulae -- A Tableau Method for Interval Temporal Logic with Projection -- Bounded Model Search in Linear Temporal Logic and Its Application to Planning -- On Proof Complexity of Circumscription -- Tableaux for Finite-Valued Logics with Arbitrary Distribution Modalities -- Some Remarks on Completeness, Connection Graph Resolution, and Link Deletion -- Simplification and Backjumping in Modal Tableau -- Free Variable Tableaux for a Logic with Term Declarations -- Simplification A General Constraint Propagation Technique for Propositional and Modal Tableaux -- A Tableaux Calculus for Ambiguous Quantifiation -- From Kripke Models to Algebraic Counter-Valuations -- Deleting Redundancy in Proof Reconstruction -- A New One-Pass Tableau Calculus for PLTL -- Decision Procedures for Intuitionistic Propositional Logic by Program Extraction -- Contributed System Descriptions -- The FaCT System -- Implementation of Proof Search in the Imperative Programming Language Pizza -- p-SETHEO: Strategy Parallelism in Automated Theorem Proving.
In: Springer eBooks
Item type: E-BOOKS
Tags from this library: No tags from this library for this title. Log in to add tags.
    Average rating: 0.0 (0 votes)
Current library Home library Call number Materials specified URL Status Date due Barcode
IMSc Library
IMSc Library
Link to resource Available EBK7359

Extended Abstracts of Invited Lectures -- Philosophical Aspects of Computerized Verification of Mathematics -- A Science of Reasoning (Extended Abstract) -- Model Checking: Historical Perspective and Example (Extended Abstract) -- Comparison -- Comparison of Theorem Provers for Modal Logics — Introduction and Summary -- FaCT and DLP -- Prover KT4 -- leanK 2.0 -- Logics Workbench 1.0 -- Optimised Functional Translation and Resolution -- Benchmark Evaluation of ?KE -- Abstracts of the Tutorials -- Implementation of Propositional Temporal Logics Using BDDs -- Computer Programming as Mathematics in a Programming Language and Proof System CL -- Contributed Research Papers -- A Tableau Calculus for Multimodal Logics and Some (Un)Decidability Results -- Hyper Tableau — The Next Generation -- Fibring Semantic Tableaux -- A Tableau Calculus for Quantifier-Free Set Theoretic Formulae -- A Tableau Method for Interval Temporal Logic with Projection -- Bounded Model Search in Linear Temporal Logic and Its Application to Planning -- On Proof Complexity of Circumscription -- Tableaux for Finite-Valued Logics with Arbitrary Distribution Modalities -- Some Remarks on Completeness, Connection Graph Resolution, and Link Deletion -- Simplification and Backjumping in Modal Tableau -- Free Variable Tableaux for a Logic with Term Declarations -- Simplification A General Constraint Propagation Technique for Propositional and Modal Tableaux -- A Tableaux Calculus for Ambiguous Quantifiation -- From Kripke Models to Algebraic Counter-Valuations -- Deleting Redundancy in Proof Reconstruction -- A New One-Pass Tableau Calculus for PLTL -- Decision Procedures for Intuitionistic Propositional Logic by Program Extraction -- Contributed System Descriptions -- The FaCT System -- Implementation of Proof Search in the Imperative Programming Language Pizza -- p-SETHEO: Strategy Parallelism in Automated Theorem Proving.

There are no comments on this title.

to post a comment.
The Institute of Mathematical Sciences, Chennai, India

Powered by Koha