Automated Deduction — A Basis for Applications: Volume III Applications

✍ Scribed by Ingo Dahn (auth.), Wolfgang Bibel, Peter H. Schmitt (eds.)

• Publisher: Springer Netherlands
• Year: 1998
• Tongue: English
• Leaves: 339
• Series: Applied Logic Series 10
• Edition: 1
• Category: Library

✦ Synopsis

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.

✦ Table of Contents

Front Matter....Pages i-xii
Front Matter....Pages 1-7
Lattice-Ordered Groups in Deduction....Pages 9-29
Superposition Theorem Proving for Commutative Rings....Pages 31-55
How to Augment a Formal System with a Boolean Algebra Component....Pages 57-75
Proof Planning: A Practical Approach to Mechanized Reasoning in Mathematics....Pages 77-95
Front Matter....Pages 97-104
Program Synthesis....Pages 105-134
Termination Analysis for Functional Programs....Pages 135-164
The WAM Case Study: Verifying Compiler Correctness for Prolog with KIV....Pages 165-194
Using Automated Theorem Provers in Verification of Protocols....Pages 195-224
Theorem Proving in Large Theories....Pages 225-241
Analyzing Rule Sets for the Calculation of Banking Fees by a Theorem Prover with Constraints....Pages 243-264
Deduction-Based Software Component Retrieval....Pages 265-292
Rewrite Based Hardware Verification with Redux....Pages 293-316
Back Matter....Pages 317-335

✦ Subjects

Logic; Artificial Intelligence (incl. Robotics); Software Engineering/Programming and Operating Systems; Symbolic and Algebraic Manipulation; Mathematical Logic and Foundations