The synthesis of logic programs from inductive proofs:
Abstract: "We describe a technique for synthesising logic (Prolog) programs from non-executable specifications. This technique is adapted from one for synthesising functional programs as total functions. Logic programs, on the other hand, define predicates. They can be run in different input mo...
Gespeichert in:
| Hauptverfasser: | , , |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Edinburgh
1990.
|
| Schriftenreihe: | University <Edinburgh> / Department of Artificial Intelligence: DAI research paper
501 |
| Schlagworte: | |
| Zusammenfassung: | Abstract: "We describe a technique for synthesising logic (Prolog) programs from non-executable specifications. This technique is adapted from one for synthesising functional programs as total functions. Logic programs, on the other hand, define predicates. They can be run in different input modes, they sometimes produce multiple outputs and sometimes none. They may not terminate. The key idea of the adaptation is that a predicate is a total function in the all-ground mode, i.e. when all its arguments are inputs (pred(+,...,+) in Prolog notation). The program is synthesised as a function in this mode and then run in other modes To make the technique work it is necessary to synthesise pure logic programs, without the closed world assumption, and then compile these into Prolog programs. The technique has been tested on the OYSTER (functional) program development system. |
| Beschreibung: | 13 S. |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV010452639 | ||
| 003 | DE-604 | ||
| 005 | 19951027 | ||
| 007 | t | ||
| 008 | 951027s1990 |||| 00||| engod | ||
| 035 | |a (OCoLC)1072997404 | ||
| 035 | |a (DE-599)BVBBV010452639 | ||
| 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 The synthesis of logic programs from inductive proofs |c Alan Bundy, Alan Smaill and Geraint Wiggins |
| 264 | 1 | |a Edinburgh |c 1990. | |
| 300 | |a 13 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 501 | |
| 520 | 3 | |a Abstract: "We describe a technique for synthesising logic (Prolog) programs from non-executable specifications. This technique is adapted from one for synthesising functional programs as total functions. Logic programs, on the other hand, define predicates. They can be run in different input modes, they sometimes produce multiple outputs and sometimes none. They may not terminate. The key idea of the adaptation is that a predicate is a total function in the all-ground mode, i.e. when all its arguments are inputs (pred(+,...,+) in Prolog notation). The program is synthesised as a function in this mode and then run in other modes | |
| 520 | 3 | |a To make the technique work it is necessary to synthesise pure logic programs, without the closed world assumption, and then compile these into Prolog programs. The technique has been tested on the OYSTER (functional) program development system. | |
| 650 | 7 | |a Computer software |2 sigle | |
| 650 | 4 | |a Induction | |
| 650 | 4 | |a Logic programming | |
| 650 | 4 | |a Proof theory | |
| 700 | 1 | |a Smaill, Alan |e Verfasser |4 aut | |
| 700 | 1 | |a Wiggins, Geraint |e Verfasser |4 aut | |
| 810 | 2 | |a Department of Artificial Intelligence: DAI research paper |t University <Edinburgh> |v 501 |w (DE-604)BV010450646 |9 501 | |
| 943 | 1 | |a oai:aleph.bib-bvb.de:BVB01-006965514 | |
Datensatz im Suchindex
| _version_ | 1812974139004157952 |
|---|---|
| adam_text | |
| any_adam_object | |
| author | Bundy, Alan Smaill, Alan Wiggins, Geraint |
| author_facet | Bundy, Alan Smaill, Alan Wiggins, Geraint |
| author_role | aut aut aut |
| author_sort | Bundy, Alan |
| author_variant | a b ab a s as g w gw |
| building | Verbundindex |
| bvnumber | BV010452639 |
| ctrlnum | (OCoLC)1072997404 (DE-599)BVBBV010452639 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>00000nam a2200000 cb4500</leader><controlfield tag="001">BV010452639</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">19951027</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">951027s1990 |||| 00||| engod</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)1072997404</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV010452639</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">The synthesis of logic programs from inductive proofs</subfield><subfield code="c">Alan Bundy, Alan Smaill and Geraint Wiggins</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Edinburgh</subfield><subfield code="c">1990.</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">13 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">501</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Abstract: "We describe a technique for synthesising logic (Prolog) programs from non-executable specifications. This technique is adapted from one for synthesising functional programs as total functions. Logic programs, on the other hand, define predicates. They can be run in different input modes, they sometimes produce multiple outputs and sometimes none. They may not terminate. The key idea of the adaptation is that a predicate is a total function in the all-ground mode, i.e. when all its arguments are inputs (pred(+,...,+) in Prolog notation). The program is synthesised as a function in this mode and then run in other modes</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">To make the technique work it is necessary to synthesise pure logic programs, without the closed world assumption, and then compile these into Prolog programs. The technique has been tested on the OYSTER (functional) program development system.</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">Induction</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Logic programming</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Proof theory</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Smaill, Alan</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Wiggins, Geraint</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</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">501</subfield><subfield code="w">(DE-604)BV010450646</subfield><subfield code="9">501</subfield></datafield><datafield tag="943" ind1="1" ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-006965514</subfield></datafield></record></collection> |
| id | DE-604.BV010452639 |
| illustrated | Not Illustrated |
| indexdate | 2024-10-15T10:07:52Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-006965514 |
| oclc_num | 1072997404 |
| open_access_boolean | |
| owner | DE-91G DE-BY-TUM |
| owner_facet | DE-91G DE-BY-TUM |
| physical | 13 S. |
| publishDate | 1990 |
| publishDateSearch | 1990 |
| publishDateSort | 1990 |
| record_format | marc |
| series2 | University <Edinburgh> / Department of Artificial Intelligence: DAI research paper |
| spelling | Bundy, Alan Verfasser aut The synthesis of logic programs from inductive proofs Alan Bundy, Alan Smaill and Geraint Wiggins Edinburgh 1990. 13 S. txt rdacontent n rdamedia nc rdacarrier University <Edinburgh> / Department of Artificial Intelligence: DAI research paper 501 Abstract: "We describe a technique for synthesising logic (Prolog) programs from non-executable specifications. This technique is adapted from one for synthesising functional programs as total functions. Logic programs, on the other hand, define predicates. They can be run in different input modes, they sometimes produce multiple outputs and sometimes none. They may not terminate. The key idea of the adaptation is that a predicate is a total function in the all-ground mode, i.e. when all its arguments are inputs (pred(+,...,+) in Prolog notation). The program is synthesised as a function in this mode and then run in other modes To make the technique work it is necessary to synthesise pure logic programs, without the closed world assumption, and then compile these into Prolog programs. The technique has been tested on the OYSTER (functional) program development system. Computer software sigle Induction Logic programming Proof theory Smaill, Alan Verfasser aut Wiggins, Geraint Verfasser aut Department of Artificial Intelligence: DAI research paper University <Edinburgh> 501 (DE-604)BV010450646 501 |
| spellingShingle | Bundy, Alan Smaill, Alan Wiggins, Geraint The synthesis of logic programs from inductive proofs Computer software sigle Induction Logic programming Proof theory |
| title | The synthesis of logic programs from inductive proofs |
| title_auth | The synthesis of logic programs from inductive proofs |
| title_exact_search | The synthesis of logic programs from inductive proofs |
| title_full | The synthesis of logic programs from inductive proofs Alan Bundy, Alan Smaill and Geraint Wiggins |
| title_fullStr | The synthesis of logic programs from inductive proofs Alan Bundy, Alan Smaill and Geraint Wiggins |
| title_full_unstemmed | The synthesis of logic programs from inductive proofs Alan Bundy, Alan Smaill and Geraint Wiggins |
| title_short | The synthesis of logic programs from inductive proofs |
| title_sort | the synthesis of logic programs from inductive proofs |
| topic | Computer software sigle Induction Logic programming Proof theory |
| topic_facet | Computer software Induction Logic programming Proof theory |
| volume_link | (DE-604)BV010450646 |
| work_keys_str_mv | AT bundyalan thesynthesisoflogicprogramsfrominductiveproofs AT smaillalan thesynthesisoflogicprogramsfrominductiveproofs AT wigginsgeraint thesynthesisoflogicprogramsfrominductiveproofs |