Automated Reasoning with Analytic Tableaux and Related Methods
Editat de Uwe Egly, Christian G. Fernmülleren Limba Engleză Paperback – 17 iul 2002
Preț: 336.36 lei
Preț vechi: 420.46 lei
-20% Nou
Puncte Express: 505
Preț estimativ în valută:
59.53€ • 69.81$ • 52.19£
59.53€ • 69.81$ • 52.19£
Carte tipărită la comandă
Livrare economică 26 ianuarie-09 februarie 26
Preluare comenzi: 021 569.72.76
Specificații
ISBN-13: 9783540439295
ISBN-10: 3540439293
Pagini: 356
Ilustrații: X, 346 p.
Dimensiuni: 216 x 279 x 20 mm
Greutate: 0.89 kg
Ediția:2002
Editura: Springer
Locul publicării:Berlin, Heidelberg, Germany
ISBN-10: 3540439293
Pagini: 356
Ilustrații: X, 346 p.
Dimensiuni: 216 x 279 x 20 mm
Greutate: 0.89 kg
Ediția:2002
Editura: Springer
Locul publicării:Berlin, Heidelberg, Germany
Public țintă
ResearchCuprins
Invited Papers.- Proof Analysis by Resolution.- Using Linear Logic to Reason about Sequent Systems.- Research Papers.- A Schütte-Tait Style Cut-Elimination Proof for First-Order Gödel Logic.- Tableaux for Quantified Hybrid Logic.- Tableau-Based Automated Deduction for Duration Calculus.- Linear Time Logic, Conditioned Models, and Planning with Incomplete Knowledge.- A Simplified Clausal Resolution Procedure for Propositional Linear-Time Temporal Logic.- Modal Nonmonotonic Logics Revisited: Efficient Encodings for the Basic Reasoning Tasks.- Tableau Calculi for the Logics of Finite k-Ary Trees.- A Model Generation Style Completeness Proof for Constraint Tableaux with Superposition.- Implementation and Optimisation of a Tableau Algorithm for the Guarded Fragment.- Lemma and Model Caching in Decision Procedures for Quantified Boolean Formulas.- Integration of Equality Reasoning into the Disconnection Calculus.- Analytic Sequent Calculi for Abelian and ?ukasiewicz Logics.- Analytic Tableau Systems for Propositional Bimodal Logics of Knowledge and Belief.- A Confluent Theory Connection Calculus.- On Uniform Word Problems Involving Bridging Operators on Distributive Lattices.- Question Answering: From Partitions to Prolog.- A General Theorem Prover for Quantified Modal Logics.- Some New Exceptions for the Semantic Tableaux Version of the Second Incompleteness Theorem.- A New Indefinite Semantics for Hilbert’s Epsilon.- A Tableau Calculus for Combining Non-disjoint Theories.- System Descriptions Papers.- LINK: A Proof Environment Based on Proof Nets.- DCTP 1.2 — System Abstract.
Caracteristici
Includes supplementary material: sn.pub/extras