Automated deduction CADE 17 : 17th International Conference on Automated Deduction, Pittsburgh, PA, USA, Jun
User Rating: Be the first one!
Author: International Conference on Automated Deduction (17th : 2000 : Pittsburgh, Pa.), McAllester, David A
Added by: sketch
Added Date: 2015-12-30
Language: eng
Subjects: Automatic theorem proving, Logic, Symbolic and mathematical
Publishers: Berlin ; New York : Springer
Collections: folkscanomy miscellaneous, folkscanomy, additional collections
ISBN Number: 3540676643
Pages Count: 300
PPI Count: 300
PDF Count: 1
Total Size: 255.51 MB
PDF Size: 6.61 MB
Extensions: djvu, gif, pdf, gz, zip, torrent, log, mrc
Downloads: 411
Views: 461
Total Files: 18
Media Type: texts
Total Files: 5
TORRENT
springer 10 1007 10721959 archive torren...torrent
Last Modified: 2022-03-09 08:37:45
Download
Size: 13.99 KB
Description
Automated Deduction - CADE-17: 17th International Conference on Automated Deduction Pittsburgh, PA, USA, June 17-20, 2000. Proceedings
Author: David McAllester
Published by Springer Berlin Heidelberg
ISBN: 978-3-540-67664-5
DOI: 10.1007/10721959
Table of Contents:
Includes bibliographical references and index
Author: David McAllester
Published by Springer Berlin Heidelberg
ISBN: 978-3-540-67664-5
DOI: 10.1007/10721959
Table 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 Minimization
Includes bibliographical references and index
You May Also Like
We will be happy to hear your thoughts