Cantitate/Preț
Produs

Automated Reasoning with Analytic Tableaux and Related Methods: International Conference, TABLEAUX'99, Saratoga Springs, NY, USA, June 7-11, 1999, Proceedings: Lecture Notes in Computer Science, cartea 1617

Editat de Neil V. Murray
en Limba Engleză Paperback – 26 mai 1999

Din seria Lecture Notes in Computer Science

Preț: 32798 lei

Preț vechi: 40997 lei
-20% Nou

Puncte Express: 492

Preț estimativ în valută:
6277 6520$ 5214£

Carte tipărită la comandă

Livrare economică 03-17 februarie 25

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 18 mm
Greutate: 0.48 kg
Ediția:1999
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seriile Lecture Notes in Computer Science, Lecture Notes in Artificial Intelligence

Locul publicării:Berlin, Heidelberg, Germany

Public țintă

Research

Cuprins

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