Rippling with relational definitions:
Abstract: "We propose an extension to the rippling technique of [Bundy et al 93], to improve its suitability for reasoning about theorems specified in terms of relations. The extension broadens the notion of rippling to control proofs by induction over datatypes specified by arbitrary relations...
Gespeichert in:
| Hauptverfasser: | , |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Edinburgh
1994
|
| Schriftenreihe: | University <Edinburgh> / Department of Artificial Intelligence: DAI research paper
733 |
| Schlagworte: | |
| Zusammenfassung: | Abstract: "We propose an extension to the rippling technique of [Bundy et al 93], to improve its suitability for reasoning about theorems specified in terms of relations. The extension broadens the notion of rippling to control proofs by induction over datatypes specified by arbitrary relations. In particular, it will allow synthesis of logic programs from logic-program-like specifications, broadening the possibilities for automated synthesis and transformation of logic programs discussed in [Wiggins 92]." |
| Beschreibung: | 13 S. |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV011043480 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | t | ||
| 008 | 961107s1994 |||| 00||| engod | ||
| 035 | |a (OCoLC)34847623 | ||
| 035 | |a (DE-599)BVBBV011043480 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-91G | ||
| 100 | 1 | |a Åhs, Torbjörn |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Rippling with relational definitions |c Åhs, T. : Wiggins, G. A. |
| 264 | 1 | |a Edinburgh |c 1994 | |
| 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 733 | |
| 520 | 3 | |a Abstract: "We propose an extension to the rippling technique of [Bundy et al 93], to improve its suitability for reasoning about theorems specified in terms of relations. The extension broadens the notion of rippling to control proofs by induction over datatypes specified by arbitrary relations. In particular, it will allow synthesis of logic programs from logic-program-like specifications, broadening the possibilities for automated synthesis and transformation of logic programs discussed in [Wiggins 92]." | |
| 650 | 7 | |a Bionics and artificial intelligence |2 sigle | |
| 650 | 7 | |a Computer software |2 sigle | |
| 650 | 7 | |a Mathematics |2 sigle | |
| 650 | 4 | |a Mathematik | |
| 650 | 4 | |a Automatic theorem proving | |
| 650 | 4 | |a Induction (Logic) | |
| 650 | 4 | |a Logic programming | |
| 650 | 4 | |a Reasoning | |
| 700 | 1 | |a Wiggins, Geraint A. |d 1962- |e Verfasser |0 (DE-588)12389719X |4 aut | |
| 810 | 2 | |a Department of Artificial Intelligence: DAI research paper |t University <Edinburgh> |v 733 |w (DE-604)BV010450646 |9 733 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-007394790 | ||
Datensatz im Suchindex
| _version_ | 1804125532758999040 |
|---|---|
| any_adam_object | |
| author | Åhs, Torbjörn Wiggins, Geraint A. 1962- |
| author_GND | (DE-588)12389719X |
| author_facet | Åhs, Torbjörn Wiggins, Geraint A. 1962- |
| author_role | aut aut |
| author_sort | Åhs, Torbjörn |
| author_variant | t å tå g a w ga gaw |
| building | Verbundindex |
| bvnumber | BV011043480 |
| ctrlnum | (OCoLC)34847623 (DE-599)BVBBV011043480 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01778nam a2200385 cb4500</leader><controlfield tag="001">BV011043480</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">961107s1994 |||| 00||| engod</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)34847623</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV011043480</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">Åhs, Torbjörn</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Rippling with relational definitions</subfield><subfield code="c">Åhs, T. : Wiggins, G. A.</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Edinburgh</subfield><subfield code="c">1994</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">733</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Abstract: "We propose an extension to the rippling technique of [Bundy et al 93], to improve its suitability for reasoning about theorems specified in terms of relations. The extension broadens the notion of rippling to control proofs by induction over datatypes specified by arbitrary relations. In particular, it will allow synthesis of logic programs from logic-program-like specifications, broadening the possibilities for automated synthesis and transformation of logic programs discussed in [Wiggins 92]."</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Bionics and artificial intelligence</subfield><subfield code="2">sigle</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="7"><subfield code="a">Mathematics</subfield><subfield code="2">sigle</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Mathematik</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Automatic theorem proving</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Induction (Logic)</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Logic programming</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Reasoning</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Wiggins, Geraint A.</subfield><subfield code="d">1962-</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)12389719X</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">733</subfield><subfield code="w">(DE-604)BV010450646</subfield><subfield code="9">733</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-007394790</subfield></datafield></record></collection> |
| id | DE-604.BV011043480 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-09T18:03:04Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-007394790 |
| oclc_num | 34847623 |
| open_access_boolean | |
| owner | DE-91G DE-BY-TUM |
| owner_facet | DE-91G DE-BY-TUM |
| physical | 13 S. |
| publishDate | 1994 |
| publishDateSearch | 1994 |
| publishDateSort | 1994 |
| record_format | marc |
| series2 | University <Edinburgh> / Department of Artificial Intelligence: DAI research paper |
| spelling | Åhs, Torbjörn Verfasser aut Rippling with relational definitions Åhs, T. : Wiggins, G. A. Edinburgh 1994 13 S. txt rdacontent n rdamedia nc rdacarrier University <Edinburgh> / Department of Artificial Intelligence: DAI research paper 733 Abstract: "We propose an extension to the rippling technique of [Bundy et al 93], to improve its suitability for reasoning about theorems specified in terms of relations. The extension broadens the notion of rippling to control proofs by induction over datatypes specified by arbitrary relations. In particular, it will allow synthesis of logic programs from logic-program-like specifications, broadening the possibilities for automated synthesis and transformation of logic programs discussed in [Wiggins 92]." Bionics and artificial intelligence sigle Computer software sigle Mathematics sigle Mathematik Automatic theorem proving Induction (Logic) Logic programming Reasoning Wiggins, Geraint A. 1962- Verfasser (DE-588)12389719X aut Department of Artificial Intelligence: DAI research paper University <Edinburgh> 733 (DE-604)BV010450646 733 |
| spellingShingle | Åhs, Torbjörn Wiggins, Geraint A. 1962- Rippling with relational definitions Bionics and artificial intelligence sigle Computer software sigle Mathematics sigle Mathematik Automatic theorem proving Induction (Logic) Logic programming Reasoning |
| title | Rippling with relational definitions |
| title_auth | Rippling with relational definitions |
| title_exact_search | Rippling with relational definitions |
| title_full | Rippling with relational definitions Åhs, T. : Wiggins, G. A. |
| title_fullStr | Rippling with relational definitions Åhs, T. : Wiggins, G. A. |
| title_full_unstemmed | Rippling with relational definitions Åhs, T. : Wiggins, G. A. |
| title_short | Rippling with relational definitions |
| title_sort | rippling with relational definitions |
| topic | Bionics and artificial intelligence sigle Computer software sigle Mathematics sigle Mathematik Automatic theorem proving Induction (Logic) Logic programming Reasoning |
| topic_facet | Bionics and artificial intelligence Computer software Mathematics Mathematik Automatic theorem proving Induction (Logic) Logic programming Reasoning |
| volume_link | (DE-604)BV010450646 |
| work_keys_str_mv | AT ahstorbjorn ripplingwithrelationaldefinitions AT wigginsgerainta ripplingwithrelationaldefinitions |