Automated Reasoning with Analytic Tableaux and Related Methods
Editat de Neil V. Murrayen Limba Engleză Paperback – 26 mai 1999
Preț: 323.41 lei
Preț vechi: 404.26 lei
-20% Nou
Puncte Express: 485
Preț estimativ în valută:
57.23€ • 67.20$ • 50.23£
57.23€ • 67.20$ • 50.23£
Carte tipărită la comandă
Livrare economică 27 ianuarie-10 februarie 26
Preluare comenzi: 021 569.72.76
Specificații
ISBN-13: 9783540660866
ISBN-10: 3540660860
Pagini: 344
Ilustrații: X, 334 p.
Dimensiuni: 155 x 235 x 19 mm
Greutate: 0.52 kg
Ediția:1999
Editura: Springer
Locul publicării:Berlin, Heidelberg, Germany
ISBN-10: 3540660860
Pagini: 344
Ilustrații: X, 334 p.
Dimensiuni: 155 x 235 x 19 mm
Greutate: 0.52 kg
Ediția:1999
Editura: Springer
Locul publicării:Berlin, Heidelberg, Germany
Public țintă
ResearchCuprins
Extended 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.
Caracteristici
Includes supplementary material: sn.pub/extras