New Added

Automated deduction – CADE-17 : 17th International Conference on Automated Deduction, Pittsburgh, PA, USA, June 17-20, 2000 : proceedings

Like Score+348

Automated deduction – CADE-17 : 17th International Conference on Automated Deduction, Pittsburgh, PA, USA, June 17-20, 2000 : proceedings
Original Title Automated deduction – CADE-17 : 17th International Conference on Automated Deduction, Pittsburgh, PA, USA, June 17-20, 2000 : proceedings
Author International Conference on Automated Deduction (17th : 2000 : Pittsburgh, Pa.), McAllester, David A
Publication date

Topics Automatic theorem proving, Logic, Symbolic and mathematical
Publisher Berlin , New York : Springer
Collection folkscanomy_miscellaneous, folkscanomy, additional_collections
Language English
Book Type EBook
Material Type Book
File Type PDF
Downloadable Yes
Support Mobile, Desktop, Tablet
Scan Quality: Best No watermark
PDF Quality: Good
Availability Yes
Price 0.00
Submitted By
Sketch the Cow
Submit Date
Automated Deduction – CADE-17: 17th International Conference on Automated Deduction Pittsburgh, PA, USA, June 17-20, 2000. ProceedingsAuthor: David McAllester Published by Springer Berlin Heidelberg ISBN: 978-3-540-67664-5 DOI: 10.1007/10721959Table of Contents:High-Level Verification Using Theorem Proving and Formalized Mathematics
Machine Instruction Syntax and Semantics in Higher Order Logic
Proof Generation in the Touchstone Theorem Prover
Wellfounded Schematic Definitions
Abstract Congruence Closure and Specializations
A Framework for Cooperating Decision Procedures
Modular Reasoning in Isabelle
An Infrastructure for Intertheory Reasoning
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
Scalable Knowledge Representation and Reasoning Systems
Efficient Minimal Model Generation Using Branching Lemmas
FDPLL — A First-Order Davis-Putnam-Logeman-Loveland Procedure
Rigid E-Unification Revisited
Connecting Bits with Floating-Point Numbers: Model Checking and Theorem Proving in Practice
Reducing Model Checking of the Many to the Few
Simulation Based MinimizationIncludes bibliographical references and index
We will be happy to hear your thoughts

Leave a reply

eBookmela
Logo
Register New Account
Reset Password
Compare items
  • Total (0)
Compare
0