|
![]() |
|||
|
||||
OverviewFull Product DetailsAuthor: Neil V. MurrayPublisher: Springer-Verlag Berlin and Heidelberg GmbH & Co. KG Imprint: Springer-Verlag Berlin and Heidelberg GmbH & Co. K Edition: 1999 ed. Volume: 1617 Dimensions: Width: 15.50cm , Height: 1.80cm , Length: 23.50cm Weight: 1.070kg ISBN: 9783540660866ISBN 10: 3540660860 Pages: 334 Publication Date: 26 May 1999 Audience: College/higher education , Professional and scholarly , Postgraduate, Research & Scholarly , Professional & Vocational Format: Paperback Publisher's Status: Active Availability: In Print ![]() This item will be ordered in for you from one of our suppliers. Upon receipt, we will promptly dispatch it out to you. For in store availability, please contact us. Table of ContentsExtended Abstracts of Invited Lectures.- Microprocessor Verification Using Efficient Decision Procedures for a Logic of Equality with Uninterpreted Functions.- Comparison.- Design and Results of the Tableaux-99 Non-classical (Modal) Systems Comparison.- DLP and FaCT.- Applying an ABox Consistency Tester to Modal Logic SAT Problems.- KtSeqC : System Description.- Abstracts of Tutorials.- Automated Reasoning and the Verification of Security Protocols.- Proof Confluent Tableau Calculi.- Contributed Research Papers.- Analytic Calculi for Projective Logics.- Merge Path Improvements for Minimal Model Hyper Tableaux.- CLDS for Propositional Intuitionistic Logic.- Intuitionisitic Tableau Extracted.- A Tableau-Based Decision Procedure for a Fragment of Set Theory Involving a Restricted Form of Quantification.- Bounded Contraction in Systems with Linearity.- The Non-associative Lambek Calculus with Product in Polynomial Time.- Sequent Calculi for Nominal Tense Logics: A Step Towards Mechanization?.- Cut-Free Display Calculi for Nominal Tense Logics.- Hilbert’s ?-Terms in Automated Theorem Proving.- Partial Functions in an Impredicative Simple Theory of Types.- A Simple Sequent System for First-Order Logic with Free Constructors.- linTAP : A Tableau Prover for Linear Logic.- A Tableau Calculus for a Temporal Logic with Temporal Connectives.- A Tableau Calculus for Pronoun Resolution.- Generating Minimal Herbrand Models Step by Step.- Tableau Calculi for Hybrid Logics.- Full First-Order Free Variable Sequents and Tableaux in Implicit Induction.- Contributed System Descriptions.- An Interactive Theorem Proving Assistant.- A Time Efficient KE Based Theorem Prover.- Strategy Parallel Use of Model Elimination with Lemmata.ReviewsAuthor InformationTab Content 6Author Website:Countries AvailableAll regions |