Skip to main content
SpringerLink
Log in

Automated Deduction - CADE-17

17th International Conference on Automated Deduction Pittsburgh, PA, USA, June 17-20, 2000 Proceedings

  • Conference proceedings
  • © 2000

Overview

Editors:
  1. David McAllester

    1. Toyota Technological Institute at Chicago, Chicago

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

Part of the book series: Lecture Notes in Computer Science (LNCS, volume 1831)

Part of the book sub series: Lecture Notes in Artificial Intelligence (LNAI)

This is a preview of subscription content, log in via an institution to check access.

Access this book

Log in via an institution
eBook USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

Licence this eBook for your library

Institutional subscriptions

Table of contents (49 papers)

  1. Front Matter

    Download chapter PDF

  3. Session 1:

    1. Machine Instruction Syntax and Semantics in Higher Order Logic

      • Neophytos G. Michael, Andrew W. Appel
      Pages 7-24

    2. Proof Generation in the Touchstone Theorem Prover

      • George C. Necula, Peter Lee
      Pages 25-44

    3. Wellfounded Schematic Definitions

      • Konrad Slind
      Pages 45-63

  4. Session 2:

    1. Abstract Congruence Closure and Specializations

      • Leo Bachmair, Ashish Tiwari
      Pages 64-78

    2. A Framework for Cooperating Decision Procedures

      • Clark W. Barrett, David L. Dill, Aaron Stump
      Pages 79-98

    3. Modular Reasoning in Isabelle

      • Florian Kammüller
      Pages 99-114

    4. An Infrastructure for Intertheory Reasoning

      • William M. Farmer
      Pages 115-131

  5. Session 3:

    1. Gödel’s Algorithm for Class Formation

      • Johan Gijsbertus Frederik Belinfante
      Pages 132-147

    2. Automated Proof Construction in Type Theory Using Resolution

      • Marc Bezem, Dimitri Hendriks, Hans de Nivelle
      Pages 148-163

    3. System Description: TPS: A Theorem Proving System for Type Theory

      • Peter B. Andrews, Matthew Bishop, Chad E. Brown
      Pages 164-169

    4. The Nuprl Open Logical Environment

      • Stuart F. Allen, Robert L. Constable, Rich Eaton, Christoph Kreitz, Lori Lorigo
      Pages 170-176

    5. System Description: aRa – An Automatic Theorem Prover for Relation Algebras

      • Carsten Sinz
      Pages 177-182

  6. Invited Talk:

    1. Scalable Knowledge Representation and Reasoning Systems

      • Henry Kautz
      Pages 183-183

  7. Session 4:

    1. Efficient Minimal Model Generation Using Branching Lemmas

      • Ryuzo Hasegawa, Hiroshi Fujita, Miyuki Koshimura
      Pages 184-199

    2. FDPLL — A First-Order Davis-Putnam-Logeman-Loveland Procedure

      • Peter Baumgartner
      Pages 200-219

    3. Rigid E-Unification Revisited

      • Ashish Tiwari, Leo Bachmair, Harald Ruess
      Pages 220-234

  9. Session 5:

    1. Reducing Model Checking of the Many to the Few

      • E. Allen Emerson, Vineet Kahlon
      Pages 236-254
Back to top

Keywords

About this book

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.

Editors and Affiliations

  • Toyota Technological Institute at Chicago, Chicago

    David McAllester

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation