Cantitate/Preț
Produs
Total produse
Vezi coșul
Theorem Proving with Analytic Tableaux and Related Methods: 5th International Workshop, TABLEAUX '96, Terrasini (Palermo), Italy, May 15 - 17, 1996. Proceedings de Pierangelo Miglioli

Theorem Proving with Analytic Tableaux and Related Methods: 5th International Workshop, TABLEAUX '96, Terrasini (Palermo), Italy, May 15 - 17, 1996. Proceedings: Lecture Notes in Computer Science, cartea 1071

Editat de Pierangelo Miglioli, Ugo Moscato, Daniele Mundici, Mario Ornaghi
en Limba Engleză Paperback – 24 apr 1996
This books presents the refereed proceedings of the Fifth International Workshop on Analytic Tableaux and Related Methods, TABLEAUX '96, held in Terrasini near Palermo, Italy, in May 1996.
The 18 full revised papers included together with two invited papers present state-of-the-art results in this dynamic area of research. Besides more traditional aspects of tableaux reasoning, the collection also contains several papers dealing with other approaches to automated reasoning. The spectrum of logics dealt with covers several nonclassical logics, including modal, intuitionistic, many-valued, temporal and linear logic.
Citește tot Restrânge

Din seria Lecture Notes in Computer Science

Preț: 33486 lei

Preț vechi: 41857 lei
-20% Nou

Puncte Express: 502
Preț estimativ în valută:
6410€ • 6965$ • 5388£

Carte tipărită la comandă

Livrare economică 21 aprilie-05 mai

 Adaugă în coș

Wish list
Gift list
Am citit!
Adaugă în listă
Preluare comenzi: 021 569.72.76

Specificații

ISBN-13: 9783540612087
ISBN-10: 3540612084
Pagini: 348
Ilustrații: XII, 336 p.
Dimensiuni: 155 x 235 x 18 mm
Greutate: 0.49 kg
Ediția:1996
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

On sets, types, fixed points, and checkerboards.- Fibred tableaux for multi-implication logics.- Interpolation for a sequent calculus of generalized quantifiers.- Almost duplication-free tableau calculi for prepositional lax logics.- Combining many-valued and intuitionistic tableaux.- Cyclic connections.- Incremental theory reasoning methods for semantic tableaux.- The disconnection method.- Sequent calculi for default and autoepistemic logics.- Minimal model generation with positive unit hyper-resolution tableaux.- Distributed modal theorem proving with KE.- A simple tableau system for the logic of elsewhere.- Situational Calculus, linear connection proofs and STRIPS-like planning: An experimental comparison.- Efficient loop-check for backward proof search in some non-classical propositional logics.- Strong normalization for all-style LKtq.- T-string unification: Unifying prefixes in non-classical proof methods.- A timing refinement of intuitionistic proofs and its application to the timing analysis of combinational circuits.- A tableau calculus for minimal model reasoning.- On the intuitionistic force of classical search (Extended abstract).- Proof-search in intuitionistic logic based on constraint satisfaction.