Can theorem proving keep the planes flying?:
Abstract: "Alan Bundy is Professor of Automated Reasoning in the Department of Artificial Intelligence at the University of Edinburgh. His Mathematical Reasoning Group is applying mathematics to the development of computer programs. The synthesis, verification and transformation of computer sof...
Gespeichert in:
1. Verfasser: | |
---|---|
Format: | Buch |
Sprache: | English |
Veröffentlicht: |
Edinburgh
1993
|
Schriftenreihe: | University <Edinburgh> / Department of Artificial Intelligence: DAI research paper
669 |
Schlagworte: | |
Zusammenfassung: | Abstract: "Alan Bundy is Professor of Automated Reasoning in the Department of Artificial Intelligence at the University of Edinburgh. His Mathematical Reasoning Group is applying mathematics to the development of computer programs. The synthesis, verification and transformation of computer software is done by proving mathematical theorems using an automated theorem prover. A major technical problem to be overcome is how to guide the search for a proof so the theorem prover does not become bogged down in the possibilities. To solve this problem, the Edinburgh group have developed proof planning. Their automated theorem prover first constructs an outline of the desired proof and then fills in the details of this outline." |
Beschreibung: | 5 S. |
Internformat
MARC
LEADER | 00000nam a2200000 cb4500 | ||
---|---|---|---|
001 | BV010466477 | ||
003 | DE-604 | ||
005 | 00000000000000.0 | ||
007 | t | ||
008 | 951108s1993 |||| 00||| engod | ||
035 | |a (OCoLC)31445703 | ||
035 | |a (DE-599)BVBBV010466477 | ||
040 | |a DE-604 |b ger |e rakddb | ||
041 | 0 | |a eng | |
049 | |a DE-91G | ||
100 | 1 | |a Bundy, Alan |e Verfasser |4 aut | |
245 | 1 | 0 | |a Can theorem proving keep the planes flying? |
264 | 1 | |a Edinburgh |c 1993 | |
300 | |a 5 S. | ||
336 | |b txt |2 rdacontent | ||
337 | |b n |2 rdamedia | ||
338 | |b nc |2 rdacarrier | ||
490 | 1 | |a University <Edinburgh> / Department of Artificial Intelligence: DAI research paper |v 669 | |
520 | 3 | |a Abstract: "Alan Bundy is Professor of Automated Reasoning in the Department of Artificial Intelligence at the University of Edinburgh. His Mathematical Reasoning Group is applying mathematics to the development of computer programs. The synthesis, verification and transformation of computer software is done by proving mathematical theorems using an automated theorem prover. A major technical problem to be overcome is how to guide the search for a proof so the theorem prover does not become bogged down in the possibilities. To solve this problem, the Edinburgh group have developed proof planning. Their automated theorem prover first constructs an outline of the desired proof and then fills in the details of this outline." | |
650 | 7 | |a Computer software |2 sigle | |
650 | 4 | |a Automatic theorem proving | |
810 | 2 | |a Department of Artificial Intelligence: DAI research paper |t University <Edinburgh> |v 669 |w (DE-604)BV010450646 |9 669 | |
999 | |a oai:aleph.bib-bvb.de:BVB01-006974452 |
Datensatz im Suchindex
_version_ | 1804124899370860544 |
---|---|
any_adam_object | |
author | Bundy, Alan |
author_facet | Bundy, Alan |
author_role | aut |
author_sort | Bundy, Alan |
author_variant | a b ab |
building | Verbundindex |
bvnumber | BV010466477 |
ctrlnum | (OCoLC)31445703 (DE-599)BVBBV010466477 |
format | Book |
fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01679nam a2200301 cb4500</leader><controlfield tag="001">BV010466477</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">951108s1993 |||| 00||| engod</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)31445703</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV010466477</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rakddb</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-91G</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Bundy, Alan</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Can theorem proving keep the planes flying?</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Edinburgh</subfield><subfield code="c">1993</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">5 S.</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">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="490" ind1="1" ind2=" "><subfield code="a">University <Edinburgh> / Department of Artificial Intelligence: DAI research paper</subfield><subfield code="v">669</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Abstract: "Alan Bundy is Professor of Automated Reasoning in the Department of Artificial Intelligence at the University of Edinburgh. His Mathematical Reasoning Group is applying mathematics to the development of computer programs. The synthesis, verification and transformation of computer software is done by proving mathematical theorems using an automated theorem prover. A major technical problem to be overcome is how to guide the search for a proof so the theorem prover does not become bogged down in the possibilities. To solve this problem, the Edinburgh group have developed proof planning. Their automated theorem prover first constructs an outline of the desired proof and then fills in the details of this outline."</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Computer software</subfield><subfield code="2">sigle</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Automatic theorem proving</subfield></datafield><datafield tag="810" ind1="2" ind2=" "><subfield code="a">Department of Artificial Intelligence: DAI research paper</subfield><subfield code="t">University <Edinburgh></subfield><subfield code="v">669</subfield><subfield code="w">(DE-604)BV010450646</subfield><subfield code="9">669</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-006974452</subfield></datafield></record></collection> |
id | DE-604.BV010466477 |
illustrated | Not Illustrated |
indexdate | 2024-07-09T17:53:00Z |
institution | BVB |
language | English |
oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-006974452 |
oclc_num | 31445703 |
open_access_boolean | |
owner | DE-91G DE-BY-TUM |
owner_facet | DE-91G DE-BY-TUM |
physical | 5 S. |
publishDate | 1993 |
publishDateSearch | 1993 |
publishDateSort | 1993 |
record_format | marc |
series2 | University <Edinburgh> / Department of Artificial Intelligence: DAI research paper |
spelling | Bundy, Alan Verfasser aut Can theorem proving keep the planes flying? Edinburgh 1993 5 S. txt rdacontent n rdamedia nc rdacarrier University <Edinburgh> / Department of Artificial Intelligence: DAI research paper 669 Abstract: "Alan Bundy is Professor of Automated Reasoning in the Department of Artificial Intelligence at the University of Edinburgh. His Mathematical Reasoning Group is applying mathematics to the development of computer programs. The synthesis, verification and transformation of computer software is done by proving mathematical theorems using an automated theorem prover. A major technical problem to be overcome is how to guide the search for a proof so the theorem prover does not become bogged down in the possibilities. To solve this problem, the Edinburgh group have developed proof planning. Their automated theorem prover first constructs an outline of the desired proof and then fills in the details of this outline." Computer software sigle Automatic theorem proving Department of Artificial Intelligence: DAI research paper University <Edinburgh> 669 (DE-604)BV010450646 669 |
spellingShingle | Bundy, Alan Can theorem proving keep the planes flying? Computer software sigle Automatic theorem proving |
title | Can theorem proving keep the planes flying? |
title_auth | Can theorem proving keep the planes flying? |
title_exact_search | Can theorem proving keep the planes flying? |
title_full | Can theorem proving keep the planes flying? |
title_fullStr | Can theorem proving keep the planes flying? |
title_full_unstemmed | Can theorem proving keep the planes flying? |
title_short | Can theorem proving keep the planes flying? |
title_sort | can theorem proving keep the planes flying |
topic | Computer software sigle Automatic theorem proving |
topic_facet | Computer software Automatic theorem proving |
volume_link | (DE-604)BV010450646 |
work_keys_str_mv | AT bundyalan cantheoremprovingkeeptheplanesflying |