| Dewey Class |
006.3 |
| Titel |
Automated Deduction — A Basis for Applications ([EBook] :) : Volume III Applications / / edited by Wolfgang Bibel, Peter H. Schmitt. |
| Added Personal Name |
Bibel, Wolfgang editor. |
| Schmitt, Peter H. editor. |
| Other name(s) |
SpringerLink (Online service) |
| Veröffentl |
Dordrecht : : Springer Netherlands : : Imprint: Springer, , 1998. |
| Physical Details |
XII, 335 p. : online resource. |
| Reihe |
Applied Logic Series 1386-2790 ; ; 10 |
| ISBN |
9789401704373 |
| Summary Note |
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.: |
| Contents note |
1 Lattice-ordered Groups in Deduction -- 2 Superposition Theorem Proving for Commutative Rings -- 3 How to Augment a Formal System with a Boolean Algebra Component -- 4 Proof Planning: A Practical Approach to Mechanized Reasoning in Mathematics -- 5 Program Synthesis -- 6 Termination Analysis for Functional Programs -- 7 The WAM Case Study: Verifying Compiler Correctness for Prolog with KIV -- 8 Using Automated Theorem Provers in Verification of Protocols -- 9 Theorem Proving in Large Theories -- 10 Analyzing Rule Sets for the Calculation of Banking Fees by a Theorem Prover with Constraints -- 11 Deduction-Based Software Component Retrieval -- 12 Rewrite Based Hardware Verification with ReDuX. |
| System details note |
Online access to this digital book is restricted to subscription institutions through IP address (only for SISSA internal users) |
| Internet Site |
http://dx.doi.org/10.1007/978-94-017-0437-3 |
| LINKS ZU 'VERWANDTEN WERKEN |
Schlagwörter: .
Artificial intelligence .
Artificial Intelligence (incl. Robotics) .
Computer Science .
Logic .
Mathematical logic .
Mathematical Logic and Foundations .
Software Engineering .
Software Engineering/Programming and Operating Systems .
Symbolic and Algebraic Manipulation .
Authors:
Corporate Authors:
Series:
Classification:
|
|---|
