Extending the proof plan methodology to computer configuration problems:
Abstract: "This paper examines whether the technique of proof plans, developed originally for use in theorem proving, can be successfully applied outwith [sic] mathematics. We look at a problem associated with the configuration of large computer systems, namely that of checking orders drawn up...
Gespeichert in:
1. Verfasser: | |
---|---|
Format: | Buch |
Sprache: | English |
Veröffentlicht: |
Edinburgh
1991
|
Schriftenreihe: | University <Edinburgh> / Department of Artificial Intelligence: DAI research paper
537 |
Schlagworte: | |
Zusammenfassung: | Abstract: "This paper examines whether the technique of proof plans, developed originally for use in theorem proving, can be successfully applied outwith [sic] mathematics. We look at a problem associated with the configuration of large computer systems, namely that of checking orders drawn up by sales people on behalf of customers. Strategies exist for this task which may be explicitly encoded. We discuss the formation of plans for order checking and the factors involved in determining whether such plans can be guaranteed to succeed." |
Beschreibung: | 30 S. |
Internformat
MARC
LEADER | 00000nam a2200000 cb4500 | ||
---|---|---|---|
001 | BV010453832 | ||
003 | DE-604 | ||
005 | 19991124 | ||
007 | t | ||
008 | 951030s1991 |||| 00||| engod | ||
035 | |a (OCoLC)25807926 | ||
035 | |a (DE-599)BVBBV010453832 | ||
040 | |a DE-604 |b ger |e rakddb | ||
041 | 0 | |a eng | |
049 | |a DE-91G | ||
084 | |a DAT 706f |2 stub | ||
100 | 1 | |a Lowe, Helen |e Verfasser |4 aut | |
245 | 1 | 0 | |a Extending the proof plan methodology to computer configuration problems |
264 | 1 | |a Edinburgh |c 1991 | |
300 | |a 30 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 537 | |
520 | 3 | |a Abstract: "This paper examines whether the technique of proof plans, developed originally for use in theorem proving, can be successfully applied outwith [sic] mathematics. We look at a problem associated with the configuration of large computer systems, namely that of checking orders drawn up by sales people on behalf of customers. Strategies exist for this task which may be explicitly encoded. We discuss the formation of plans for order checking and the factors involved in determining whether such plans can be guaranteed to succeed." | |
650 | 7 | |a Computer software |2 sigle | |
650 | 4 | |a Computer software | |
810 | 2 | |a Department of Artificial Intelligence: DAI research paper |t University <Edinburgh> |v 537 |w (DE-604)BV010450646 |9 537 | |
999 | |a oai:aleph.bib-bvb.de:BVB01-006966550 |
Datensatz im Suchindex
_version_ | 1804124887433871360 |
---|---|
any_adam_object | |
author | Lowe, Helen |
author_facet | Lowe, Helen |
author_role | aut |
author_sort | Lowe, Helen |
author_variant | h l hl |
building | Verbundindex |
bvnumber | BV010453832 |
classification_tum | DAT 706f |
ctrlnum | (OCoLC)25807926 (DE-599)BVBBV010453832 |
discipline | Informatik |
format | Book |
fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01542nam a2200313 cb4500</leader><controlfield tag="001">BV010453832</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">19991124 </controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">951030s1991 |||| 00||| engod</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)25807926</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV010453832</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="084" ind1=" " ind2=" "><subfield code="a">DAT 706f</subfield><subfield code="2">stub</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Lowe, Helen</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Extending the proof plan methodology to computer configuration problems</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Edinburgh</subfield><subfield code="c">1991</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">30 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">537</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Abstract: "This paper examines whether the technique of proof plans, developed originally for use in theorem proving, can be successfully applied outwith [sic] mathematics. We look at a problem associated with the configuration of large computer systems, namely that of checking orders drawn up by sales people on behalf of customers. Strategies exist for this task which may be explicitly encoded. We discuss the formation of plans for order checking and the factors involved in determining whether such plans can be guaranteed to succeed."</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">Computer software</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">537</subfield><subfield code="w">(DE-604)BV010450646</subfield><subfield code="9">537</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-006966550</subfield></datafield></record></collection> |
id | DE-604.BV010453832 |
illustrated | Not Illustrated |
indexdate | 2024-07-09T17:52:48Z |
institution | BVB |
language | English |
oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-006966550 |
oclc_num | 25807926 |
open_access_boolean | |
owner | DE-91G DE-BY-TUM |
owner_facet | DE-91G DE-BY-TUM |
physical | 30 S. |
publishDate | 1991 |
publishDateSearch | 1991 |
publishDateSort | 1991 |
record_format | marc |
series2 | University <Edinburgh> / Department of Artificial Intelligence: DAI research paper |
spelling | Lowe, Helen Verfasser aut Extending the proof plan methodology to computer configuration problems Edinburgh 1991 30 S. txt rdacontent n rdamedia nc rdacarrier University <Edinburgh> / Department of Artificial Intelligence: DAI research paper 537 Abstract: "This paper examines whether the technique of proof plans, developed originally for use in theorem proving, can be successfully applied outwith [sic] mathematics. We look at a problem associated with the configuration of large computer systems, namely that of checking orders drawn up by sales people on behalf of customers. Strategies exist for this task which may be explicitly encoded. We discuss the formation of plans for order checking and the factors involved in determining whether such plans can be guaranteed to succeed." Computer software sigle Computer software Department of Artificial Intelligence: DAI research paper University <Edinburgh> 537 (DE-604)BV010450646 537 |
spellingShingle | Lowe, Helen Extending the proof plan methodology to computer configuration problems Computer software sigle Computer software |
title | Extending the proof plan methodology to computer configuration problems |
title_auth | Extending the proof plan methodology to computer configuration problems |
title_exact_search | Extending the proof plan methodology to computer configuration problems |
title_full | Extending the proof plan methodology to computer configuration problems |
title_fullStr | Extending the proof plan methodology to computer configuration problems |
title_full_unstemmed | Extending the proof plan methodology to computer configuration problems |
title_short | Extending the proof plan methodology to computer configuration problems |
title_sort | extending the proof plan methodology to computer configuration problems |
topic | Computer software sigle Computer software |
topic_facet | Computer software |
volume_link | (DE-604)BV010450646 |
work_keys_str_mv | AT lowehelen extendingtheproofplanmethodologytocomputerconfigurationproblems |