The Efficiency of Theorem Proving Strategies
Author : David A. Plaisted
Publisher :
Page : 184 pages
File Size : 20,25 MB
Release : 2014-01-15
Category :
ISBN : 9783663078487
Author : David A. Plaisted
Publisher :
Page : 184 pages
File Size : 20,25 MB
Release : 2014-01-15
Category :
ISBN : 9783663078487
Author : David A. Plaisted
Publisher : Springer Science & Business Media
Page : 179 pages
File Size : 18,77 MB
Release : 2013-11-11
Category : Computers
ISBN : 3663078477
Dieses Buch in englischer Sprache widmet sich dem Thema der Effizienz von Beweisstrategien und bietet eine vergleichende und asymptotische Analyse. Das Werk stellt erstmalig asymptotische Schranken für die Größe der von vielen gebräuchlichen Beweisstrategien erzeugten Suchfelder bereit. Auf diese Weise erlaubt es ein theoretisches Verständnis der Effizienz unterschiedlicher Beweisverfahren. Es wird ein fundamental neues Werkzeug für den Effizienzvergleich von Beweisstrategien bereitgestellt. Die zweite Auflage wurde gegenüber der ersten leicht verbessert, neuere Literaturhinweise zudem berücksichtigt. This book is unique in that it gives asymptotic bounds on the sizes of the search spaces generated by many common theorem proving strategies. Thus it permits one to gain a theoretical unterstanding of the efficiencies of many different theorem proving methods. This is a fundamental new tool in the comparative study of theorem proving strategies.
Author : David A. Plaisted
Publisher :
Page : 39 pages
File Size : 35,8 MB
Release : 1994
Category :
ISBN :
Author : Donald Grant Kuehner
Publisher :
Page : 0 pages
File Size : 19,16 MB
Release : 1971
Category : Automatic theorem proving
ISBN :
Author : Larry Wos
Publisher :
Page : 14 pages
File Size : 20,73 MB
Release : 1965
Category :
ISBN :
Author : Peter Baumgartner
Publisher : Springer Science & Business Media
Page : 372 pages
File Size : 34,95 MB
Release : 1995-04-26
Category : Computers
ISBN : 9783540593386
This volume constitutes the proceedings of the 4th International Workshop on Theorem Proving with Analytic Tableaux and Related Methods, TABLEAU '95, held at Schloß Rheinfels, St. Goar, Germany in May 1995. Originally tableau calculi and their relatives were favored primarily as a pedagogical device because of their advantages at the presentation level. The 23 full revised papers in this book bear witness that these methods have now gained fundamental importance in theorem proving, particularly as competitors for resolution methods. The book is organized in sections on extensions, modal logic, intuitionistic logic, the connection method and model elimination, non-clausal proof procedures, linear logic, higher-order logic, and applications
Author : Wolfgang Bibel
Publisher : Springer Science & Business Media
Page : 434 pages
File Size : 46,28 MB
Release : 2013-03-09
Category : Philosophy
ISBN : 940170435X
1. BASIC CONCEPTS OF INTERACTIVE THEOREM PROVING Interactive Theorem Proving ultimately aims at the construction of powerful reasoning tools that let us (computer scientists) prove things we cannot prove without the tools, and the tools cannot prove without us. Interaction typi cally is needed, for example, to direct and control the reasoning, to speculate or generalize strategic lemmas, and sometimes simply because the conjec ture to be proved does not hold. In software verification, for example, correct versions of specifications and programs typically are obtained only after a number of failed proof attempts and subsequent error corrections. Different interactive theorem provers may actually look quite different: They may support different logics (first-or higher-order, logics of programs, type theory etc.), may be generic or special-purpose tools, or may be tar geted to different applications. Nevertheless, they share common concepts and paradigms (e.g. architectural design, tactics, tactical reasoning etc.). The aim of this chapter is to describe the common concepts, design principles, and basic requirements of interactive theorem provers, and to explore the band width of variations. Having a 'person in the loop', strongly influences the design of the proof tool: proofs must remain comprehensible, - proof rules must be high-level and human-oriented, - persistent proof presentation and visualization becomes very important.
Author : Ramayya Kumar
Publisher : Springer Science & Business Media
Page : 324 pages
File Size : 40,50 MB
Release : 1995-03-06
Category : Computers
ISBN : 9783540590477
This two-volume set contains papers presented at the International Conference on Computational Engineering Science (ICES '95) held in Mauna Lani, Hawaii from 30 July to 3 August, 1995. The contributions capture the state of the science in computational modeling and simulation in a variety of engineering disciplines: civil, mechanical, aerospace, materials and electronics engineering.
Author : Jim Grundy
Publisher : Springer Science & Business Media
Page : 516 pages
File Size : 45,9 MB
Release : 1998-09-09
Category : Computers
ISBN : 9783540649878
This book constitutes the refereed proceedings of the 11th International Conference on Theorem Proving in Higher Order Logics, TPHOLs '98, held in Canberra, Australia, in September/October 1998. The 26 revised full papers presented were carefully reviewed and selected from a total of 52 submissions. Also included are two invited papers. The papers address all current aspects of theorem proving in higher order logics and formal verification and program analysis. Besides the HOL system, the theorem provers Coq, Isabelle, LAMBDA, LEGO, NuPrl, and PVS are discussed.
Author : Alan Bundy
Publisher : Springer Science & Business Media
Page : 874 pages
File Size : 20,34 MB
Release : 1994-06-08
Category : Computers
ISBN : 9783540581567
This volume contains the reviewed papers presented at the 12th International Conference on Automated Deduction (CADE-12) held at Nancy, France in June/July 1994. The 67 papers presented were selected from 177 submissions and document many of the most important research results in automated deduction since CADE-11 was held in June 1992. The volume is organized in chapters on heuristics, resolution systems, induction, controlling resolutions, ATP problems, unification, LP applications, special-purpose provers, rewrite rule termination, ATP efficiency, AC unification, higher-order theorem proving, natural systems, problem sets, and system descriptions.