Advertisement

Automated Deduction — A Basis for Applications

Volume III Applications

  • Wolfgang Bibel
  • Peter H. Schmitt

Part of the Applied Logic Series book series (APLS, volume 10)

Table of contents

  1. Front Matter
    Pages i-xii
  2. Automated theorem proving in Mathematics

  3. Automated Deduction in Software Engineering and Hardware Design

    1. Front Matter
      Pages 97-104
    2. Christoph Kreitz
      Pages 105-134
    3. Jürgen Giesl, Christoph Walther, Jürgen Brauburger
      Pages 135-164
    4. Gerhard Schellhorn, Wolfgang Ahrendt
      Pages 165-194
    5. Ingo Dahn, Johann Schumann
      Pages 195-224
    6. Wolfgang Reif, Gerhard Schellhorn
      Pages 225-241
    7. Bernd Fischer, Johann Schumann, Gregor Snelting
      Pages 265-292
    8. Reinhard Bündgen
      Pages 293-316
  4. Back Matter
    Pages 317-335

About this book

Introduction

We are invited to deal with mathematical activity in a sys­ tematic way [ ... ] one does expect and look for pleasant surprises in this requirement of a novel combination of psy­ chology, logic, mathematics and technology. Hao Wang, 1970, quoted from(Wang, 1970). The field of mathematics has been a key application area for automated theorem proving from the start, in fact the very first automatically found the­ orem was that the sum of two even numbers is even (Davis, 1983). The field of automated deduction has witnessed considerable progress and in the last decade, automated deduction methods have made their way into many areas of research and product development in computer science. For instance, deduction systems are increasingly used in software and hardware verification to ensure the correctness of computer hardware and computer programs with respect to a given specification. Logic programming, while still falling somewhat short of its expectations, is now widely used, deduc­ tive databases are well-developed and logic-based description and analysis of hard-and software is commonplace today.

Keywords

Evolution Extension automated reasoning automated theorem proving calculus complex system expert system formal method heuristics natural language optimization programming proving term rewriting verification

Editors and affiliations

  • Wolfgang Bibel
    • 1
  • Peter H. Schmitt
    • 2
  1. 1.Darmstadt University of TechnologyGermany
  2. 2.University of KarlsruheGermany

Bibliographic information

  • DOI https://doi.org/10.1007/978-94-017-0437-3
  • Copyright Information Springer Science+Business Media B.V. 1998
  • Publisher Name Springer, Dordrecht
  • eBook Packages Springer Book Archive
  • Print ISBN 978-90-481-5052-6
  • Online ISBN 978-94-017-0437-3
  • Series Print ISSN 1386-2790
  • Buy this book on publisher's site