My Account Log in

1 option

Automated Deduction - CADE-17 : 17th International Conference on Automated Deduction Pittsburgh, PA, USA, June 17-20, 2000 Proceedings / edited by David McAllester.

SpringerLink Books Lecture Notes In Computer Science (LNCS) (1997-2024) Available online

View online
Format:
Book
Contributor:
McAllester, David, editor.
SpringerLink (Online service)
Series:
Computer Science (Springer-11645)
Lecture notes in computer science. Lecture notes in artificial intelligence ; 1831.
Lecture Notes in Artificial Intelligence ; 1831
Language:
English
Subjects (All):
Artificial intelligence.
Computers.
Logic, Symbolic and mathematical.
Computer logic.
Artificial Intelligence.
Theory of Computation.
Mathematical Logic and Formal Languages.
Logics and Meanings of Programs.
Mathematical Logic and Foundations.
Local Subjects:
Artificial Intelligence.
Theory of Computation.
Mathematical Logic and Formal Languages.
Logics and Meanings of Programs.
Mathematical Logic and Foundations.
Physical Description:
1 online resource (XIV, 526 pages).
Edition:
First edition 2000.
Contained In:
Springer eBooks
Place of Publication:
Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2000.
System Details:
text file PDF
Summary:
For the past 25 years the CADE conference has been the major forum for the presentation of new results in automated deduction. This volume contains the papers and system descriptions selected for the 17th International Conference on Automated Deduction, CADE-17, held June 17-20, 2000,at Carnegie Mellon University, Pittsburgh, Pennsylvania (USA). Fifty-three research papers and twenty system descriptions were submitted by researchers from ?fteen countries. Each submission was reviewed by at least three reviewers. Twenty-four research papers and ?fteen system descriptions were accepted. The accepted papers cover a variety of topics related to t- orem proving and its applications such as proof carrying code, cryptographic protocol veri?cation, model checking, cooperating decision procedures, program veri?cation, and resolution theorem proving. The program also included three invited lectures: "High-level veri?cation using theorem proving and formalized mathematics" by John Harrison, "Sc- able Knowledge Representation and Reasoning Systems" by Henry Kautz, and "Connecting Bits with Floating-Point Numbers: Model Checking and Theorem Proving in Practice" by Carl Seger. Abstracts or full papers of these talks are included in this volume.In addition to the accepted papers, system descriptions, andinvited talks, this volumecontains one page summaries of four tutorials and ?ve workshops held in conjunction with CADE-17.
Contents:
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
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 Object Calculus 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.
Other Format:
Printed edition:
ISBN:
978-3-540-45101-3
9783540451013
Access Restriction:
Restricted for use by site license.

The Penn Libraries is committed to describing library materials using current, accurate, and responsible language. If you discover outdated or inaccurate language, please fill out this feedback form to report it and suggest alternative language.

Find

Home Release notes

My Account

Shelf Request an item Bookmarks Fines and fees Settings

Guides

Using the Find catalog Using Articles+ Using your account