Systems and Implementation Techniques:
Gespeichert in:
| Weitere Verfasser: | , |
|---|---|
| Format: | Elektronisch E-Book |
| Sprache: | English |
| Veröffentlicht: |
Dordrecht
Springer Netherlands
1998
|
| Schriftenreihe: | Automated Deduction — A Basis for Applications
Volume II Applied Logic Series 9 |
| Schlagworte: | |
| Online-Zugang: | Volltext |
| Beschreibung: | 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 typically is needed, for example, to direct and control the reasoning, to speculate or generalize strategic lemmas, and sometimes simply because the conjecture 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 targeted 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 bandwidth 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 |
| Beschreibung: | 1 Online-Ressource (XIV, 434 p) |
| ISBN: | 9789401704359 9789048150519 |
| ISSN: | 1386-2790 |
| DOI: | 10.1007/978-94-017-0435-9 |
Internformat
MARC
| LEADER | 00000nmm a2200000zcb4500 | ||
|---|---|---|---|
| 001 | BV042424209 | ||
| 003 | DE-604 | ||
| 005 | 20180116 | ||
| 007 | cr|uuu---uuuuu | ||
| 008 | 150317s1998 |||| o||u| ||||||eng d | ||
| 020 | |a 9789401704359 |c Online |9 978-94-017-0435-9 | ||
| 020 | |a 9789048150519 |c Print |9 978-90-481-5051-9 | ||
| 024 | 7 | |a 10.1007/978-94-017-0435-9 |2 doi | |
| 035 | |a (OCoLC)906695719 | ||
| 035 | |a (DE-599)BVBBV042424209 | ||
| 040 | |a DE-604 |b ger |e aacr | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-384 |a DE-703 |a DE-91 |a DE-634 | ||
| 082 | 0 | |a 160 |2 23 | |
| 084 | |a MAT 000 |2 stub | ||
| 100 | 1 | |a Bibel, Wolfgang |4 edt | |
| 245 | 1 | 0 | |a Systems and Implementation Techniques |c edited by Wolfgang Bibel, Peter H. Schmitt |
| 264 | 1 | |a Dordrecht |b Springer Netherlands |c 1998 | |
| 300 | |a 1 Online-Ressource (XIV, 434 p) | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b c |2 rdamedia | ||
| 338 | |b cr |2 rdacarrier | ||
| 490 | 1 | |a Automated Deduction — A Basis for Applications |v Volume II | |
| 490 | 1 | |a Applied Logic Series |v 9 |x 1386-2790 | |
| 500 | |a 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 typically is needed, for example, to direct and control the reasoning, to speculate or generalize strategic lemmas, and sometimes simply because the conjecture 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 targeted 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 bandwidth 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 | ||
| 650 | 4 | |a Philosophy (General) | |
| 650 | 4 | |a Logic | |
| 650 | 4 | |a Software engineering | |
| 650 | 4 | |a Algebra / Data processing | |
| 650 | 4 | |a Artificial intelligence | |
| 650 | 4 | |a Logic, Symbolic and mathematical | |
| 650 | 4 | |a Philosophy | |
| 650 | 4 | |a Artificial Intelligence (incl. Robotics) | |
| 650 | 4 | |a Software Engineering/Programming and Operating Systems | |
| 650 | 4 | |a Symbolic and Algebraic Manipulation | |
| 650 | 4 | |a Mathematical Logic and Foundations | |
| 650 | 4 | |a Datenverarbeitung | |
| 650 | 4 | |a Künstliche Intelligenz | |
| 650 | 4 | |a Philosophie | |
| 700 | 1 | |a Schmitt, Peter H. |4 edt | |
| 830 | 0 | |a Automated Deduction — A Basis for Applications |v Volume II |w (DE-604)BV012067411 |9 2 | |
| 830 | 0 | |a Applied Logic Series |v 9 |w (DE-604)BV011076498 |9 9 | |
| 856 | 4 | 0 | |u https://doi.org/10.1007/978-94-017-0435-9 |x Verlag |3 Volltext |
| 912 | |a ZDB-2-SMA |a ZDB-2-BAE | ||
| 940 | 1 | |q ZDB-2-SMA_Archive | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-027859626 | ||
Datensatz im Suchindex
| _version_ | 1804153100916752384 |
|---|---|
| any_adam_object | |
| author2 | Bibel, Wolfgang Schmitt, Peter H. |
| author2_role | edt edt |
| author2_variant | w b wb p h s ph phs |
| author_facet | Bibel, Wolfgang Schmitt, Peter H. |
| building | Verbundindex |
| bvnumber | BV042424209 |
| classification_tum | MAT 000 |
| collection | ZDB-2-SMA ZDB-2-BAE |
| ctrlnum | (OCoLC)906695719 (DE-599)BVBBV042424209 |
| dewey-full | 160 |
| dewey-hundreds | 100 - Philosophy & psychology |
| dewey-ones | 160 - Philosophical logic |
| dewey-raw | 160 |
| dewey-search | 160 |
| dewey-sort | 3160 |
| dewey-tens | 160 - Philosophical logic |
| discipline | Mathematik Philosophie |
| doi_str_mv | 10.1007/978-94-017-0435-9 |
| format | Electronic eBook |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>03472nmm a2200577zcb4500</leader><controlfield tag="001">BV042424209</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20180116 </controlfield><controlfield tag="007">cr|uuu---uuuuu</controlfield><controlfield tag="008">150317s1998 |||| o||u| ||||||eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9789401704359</subfield><subfield code="c">Online</subfield><subfield code="9">978-94-017-0435-9</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9789048150519</subfield><subfield code="c">Print</subfield><subfield code="9">978-90-481-5051-9</subfield></datafield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1007/978-94-017-0435-9</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)906695719</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV042424209</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">aacr</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-384</subfield><subfield code="a">DE-703</subfield><subfield code="a">DE-91</subfield><subfield code="a">DE-634</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">160</subfield><subfield code="2">23</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">MAT 000</subfield><subfield code="2">stub</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Bibel, Wolfgang</subfield><subfield code="4">edt</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Systems and Implementation Techniques</subfield><subfield code="c">edited by Wolfgang Bibel, Peter H. Schmitt</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Dordrecht</subfield><subfield code="b">Springer Netherlands</subfield><subfield code="c">1998</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 Online-Ressource (XIV, 434 p)</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="b">c</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">cr</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="490" ind1="1" ind2=" "><subfield code="a">Automated Deduction — A Basis for Applications</subfield><subfield code="v">Volume II</subfield></datafield><datafield tag="490" ind1="1" ind2=" "><subfield code="a">Applied Logic Series</subfield><subfield code="v">9</subfield><subfield code="x">1386-2790</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">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 typically is needed, for example, to direct and control the reasoning, to speculate or generalize strategic lemmas, and sometimes simply because the conjecture 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 targeted 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 bandwidth 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</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Philosophy (General)</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Logic</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Software engineering</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Algebra / Data processing</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Artificial intelligence</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Logic, Symbolic and mathematical</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Philosophy</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Artificial Intelligence (incl. Robotics)</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Software Engineering/Programming and Operating Systems</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Symbolic and Algebraic Manipulation</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Mathematical Logic and Foundations</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Datenverarbeitung</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Künstliche Intelligenz</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Philosophie</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Schmitt, Peter H.</subfield><subfield code="4">edt</subfield></datafield><datafield tag="830" ind1=" " ind2="0"><subfield code="a">Automated Deduction — A Basis for Applications</subfield><subfield code="v">Volume II</subfield><subfield code="w">(DE-604)BV012067411</subfield><subfield code="9">2</subfield></datafield><datafield tag="830" ind1=" " ind2="0"><subfield code="a">Applied Logic Series</subfield><subfield code="v">9</subfield><subfield code="w">(DE-604)BV011076498</subfield><subfield code="9">9</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doi.org/10.1007/978-94-017-0435-9</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-2-SMA</subfield><subfield code="a">ZDB-2-BAE</subfield></datafield><datafield tag="940" ind1="1" ind2=" "><subfield code="q">ZDB-2-SMA_Archive</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-027859626</subfield></datafield></record></collection> |
| id | DE-604.BV042424209 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-10T01:21:15Z |
| institution | BVB |
| isbn | 9789401704359 9789048150519 |
| issn | 1386-2790 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-027859626 |
| oclc_num | 906695719 |
| open_access_boolean | |
| owner | DE-384 DE-703 DE-91 DE-BY-TUM DE-634 |
| owner_facet | DE-384 DE-703 DE-91 DE-BY-TUM DE-634 |
| physical | 1 Online-Ressource (XIV, 434 p) |
| psigel | ZDB-2-SMA ZDB-2-BAE ZDB-2-SMA_Archive |
| publishDate | 1998 |
| publishDateSearch | 1998 |
| publishDateSort | 1998 |
| publisher | Springer Netherlands |
| record_format | marc |
| series | Automated Deduction — A Basis for Applications Applied Logic Series |
| series2 | Automated Deduction — A Basis for Applications Applied Logic Series |
| spelling | Bibel, Wolfgang edt Systems and Implementation Techniques edited by Wolfgang Bibel, Peter H. Schmitt Dordrecht Springer Netherlands 1998 1 Online-Ressource (XIV, 434 p) txt rdacontent c rdamedia cr rdacarrier Automated Deduction — A Basis for Applications Volume II Applied Logic Series 9 1386-2790 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 typically is needed, for example, to direct and control the reasoning, to speculate or generalize strategic lemmas, and sometimes simply because the conjecture 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 targeted 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 bandwidth 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 Philosophy (General) Logic Software engineering Algebra / Data processing Artificial intelligence Logic, Symbolic and mathematical Philosophy Artificial Intelligence (incl. Robotics) Software Engineering/Programming and Operating Systems Symbolic and Algebraic Manipulation Mathematical Logic and Foundations Datenverarbeitung Künstliche Intelligenz Philosophie Schmitt, Peter H. edt Automated Deduction — A Basis for Applications Volume II (DE-604)BV012067411 2 Applied Logic Series 9 (DE-604)BV011076498 9 https://doi.org/10.1007/978-94-017-0435-9 Verlag Volltext |
| spellingShingle | Systems and Implementation Techniques Automated Deduction — A Basis for Applications Applied Logic Series Philosophy (General) Logic Software engineering Algebra / Data processing Artificial intelligence Logic, Symbolic and mathematical Philosophy Artificial Intelligence (incl. Robotics) Software Engineering/Programming and Operating Systems Symbolic and Algebraic Manipulation Mathematical Logic and Foundations Datenverarbeitung Künstliche Intelligenz Philosophie |
| title | Systems and Implementation Techniques |
| title_auth | Systems and Implementation Techniques |
| title_exact_search | Systems and Implementation Techniques |
| title_full | Systems and Implementation Techniques edited by Wolfgang Bibel, Peter H. Schmitt |
| title_fullStr | Systems and Implementation Techniques edited by Wolfgang Bibel, Peter H. Schmitt |
| title_full_unstemmed | Systems and Implementation Techniques edited by Wolfgang Bibel, Peter H. Schmitt |
| title_short | Systems and Implementation Techniques |
| title_sort | systems and implementation techniques |
| topic | Philosophy (General) Logic Software engineering Algebra / Data processing Artificial intelligence Logic, Symbolic and mathematical Philosophy Artificial Intelligence (incl. Robotics) Software Engineering/Programming and Operating Systems Symbolic and Algebraic Manipulation Mathematical Logic and Foundations Datenverarbeitung Künstliche Intelligenz Philosophie |
| topic_facet | Philosophy (General) Logic Software engineering Algebra / Data processing Artificial intelligence Logic, Symbolic and mathematical Philosophy Artificial Intelligence (incl. Robotics) Software Engineering/Programming and Operating Systems Symbolic and Algebraic Manipulation Mathematical Logic and Foundations Datenverarbeitung Künstliche Intelligenz Philosophie |
| url | https://doi.org/10.1007/978-94-017-0435-9 |
| volume_link | (DE-604)BV012067411 (DE-604)BV011076498 |
| work_keys_str_mv | AT bibelwolfgang systemsandimplementationtechniques AT schmittpeterh systemsandimplementationtechniques |