Automated Deduction - CADE-17
Editat de David McAllesteren Limba Engleză Paperback – 5 iun 2000
Preț: 333.43 lei
Preț vechi: 416.79 lei
-20% Nou
Puncte Express: 500
Preț estimativ în valută:
59.00€ • 69.19$ • 51.82£
59.00€ • 69.19$ • 51.82£
Carte tipărită la comandă
Livrare economică 03-17 februarie 26
Preluare comenzi: 021 569.72.76
Specificații
ISBN-13: 9783540676645
ISBN-10: 3540676643
Pagini: 540
Ilustrații: XIV, 526 p.
Dimensiuni: 155 x 235 x 29 mm
Greutate: 0.81 kg
Ediția:2000
Editura: Springer
Locul publicării:Berlin, Heidelberg, Germany
ISBN-10: 3540676643
Pagini: 540
Ilustrații: XIV, 526 p.
Dimensiuni: 155 x 235 x 29 mm
Greutate: 0.81 kg
Ediția:2000
Editura: Springer
Locul publicării:Berlin, Heidelberg, Germany
Public țintă
ResearchCuprins
Invited Talk:.- High-Level Verification Using Theorem Proving and Formalized Mathematics.- Session 1:.- Machine Instruction Syntax and Semantics in Higher Order Logic.- Proof Generation in the Touchstone Theorem Prover.- Wellfounded Schematic Definitions.- Session 2:.- Abstract Congruence Closure and Specializations.- A Framework for Cooperating Decision Procedures.- Modular Reasoning in Isabelle.- An Infrastructure for Intertheory Reasoning.- Session 3:.- Gödel’s Algorithm for Class Formation.- Automated Proof Construction in Type Theory Using Resolution.- System Description: TPS: A Theorem Proving System for Type Theory.- The Nuprl Open Logical Environment.- System Description: aRa – An Automatic Theorem Prover for Relation Algebras.- Invited Talk:.- Scalable Knowledge Representation and Reasoning Systems.- Session 4:.- Efficient Minimal Model Generation Using Branching Lemmas.- FDPLL — A First-Order Davis-Putnam-Logeman-Loveland Procedure.- Rigid E-Unification Revisited.- Invited Talk:.- Connecting Bits with Floating-Point Numbers: Model Checking and Theorem Proving in Practice.- Session 5:.- Reducing Model Checking of the Many to the Few.- Simulation Based Minimization.- Rewriting for Cryptographic Protocol Verification.- System Description: *sat: A Platform for the Development of Modal Decision Procedures.- System Description: DLP.- Two Techniques to Improve Finite Model Search.- Session 6:.- Eliminating Dummy Elimination.- Extending Decision Procedures with Induction Schemes.- Complete Monotonic Semantic Path Orderings.- Session 7:.- Stratified Resolution.- Support Ordered Resolution.- System Description: IVY.- System Description: SystemOnTPTP.- System Description: PTTP+GLiDeS Semantically Guided PTTP.- Session 8:.- A Formalization of a Concurrent ObjectCalculus up to ?-Conversion.- A Resolution Decision Procedure for Fluted Logic.- ZRes: The Old Davis–Putnam Procedure Meets ZBDD.- System Description: MBase, an Open Mathematical Knowledge Base.- System Description: Tramp: Transformation of Machine-Found Proofs into Natural Deduction Proofs at the Assertion Level.- Session 9:.- On Unification for Bounded Distributive Lattices.- Reasoning with Individuals for the Description Logic .- System Description: Embedding Verification into Microsoft Excel.- System Description: Interactive Proof Critics in XBarnacle.- Tutorials:.- Tutorial: Meta-logical Frameworks.- Tutorial: Automated Deduction and Natural Language Understanding.- Tutorial: Using TPS for Higher-Order Theorem Proving and ETPS for Teaching Logic.- Workshops:.- Workshop: Model Computation – Principles, Algorithms, Applications.- Workshop: Automation of Proof by Mathematical Induction.- Workshop: Type-Theoretic Languages: Proof-Search and Semantics.- Workshop: Automated Deduction in Education.- Workshop: The Role of Automated Deduction in Mathematics.
Caracteristici
Includes supplementary material: sn.pub/extras