Middle-out reasoning for synthesis and induction:
Abstract: "We develop two applications of middle-out reasoning in inductive proofs: Logic program synthesis and the selection of induction schemes. Middle-out reasoning as part of proof planning was first suggested by Bundy et al [Bundy et al 90a]. Middle-out reasoning uses variables to represe...
Gespeichert in:
| Hauptverfasser: | , , |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Edinburgh
1995
|
| Schriftenreihe: | University <Edinburgh> / Department of Artificial Intelligence: DAI research paper
729 |
| Schlagworte: | |
| Zusammenfassung: | Abstract: "We develop two applications of middle-out reasoning in inductive proofs: Logic program synthesis and the selection of induction schemes. Middle-out reasoning as part of proof planning was first suggested by Bundy et al [Bundy et al 90a]. Middle-out reasoning uses variables to represent unknown terms and formulae. Unification instantiates the variables in the subsequent planning, while proof planning provides the necessary search control. Middle-out reasoning is used for synthesis by planning the verification of an unknown logic program: The program body is represented with a meta-variable. The planning results both in an instantiation of the program body and a plan for the verification of that program. If the plan executes successfully, the synthesized program is partially correct and complete. Middle-out reasoning is also used to select induction schemes. Finding an appropriate induction scheme during synthesis is difficult, because the recursion of the program, which is unknown at the outset, determines the induction in the proof. In middle-out induction, we set up a schematic step case by representing the constructors that are applied to induction variables with meta-variables. Once the step case is complete, the instantiated variables correspond to an induction appropriate to the recursion of the program. We have implemented these techniques as an extension of the proof planning system CIAM [Bundy et al 90c], called Periwinkle, and synthesized a variety of programs fully automatically." |
| Beschreibung: | 27 S. |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV011043304 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | t | ||
| 008 | 961107s1995 |||| 00||| engod | ||
| 035 | |a (OCoLC)34847605 | ||
| 035 | |a (DE-599)BVBBV011043304 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-91G | ||
| 100 | 1 | |a Kraan, Ina |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Middle-out reasoning for synthesis and induction |c Ina Kraan, David Basin and Alan Bundy |
| 264 | 1 | |a Edinburgh |c 1995 | |
| 300 | |a 27 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 729 | |
| 520 | 3 | |a Abstract: "We develop two applications of middle-out reasoning in inductive proofs: Logic program synthesis and the selection of induction schemes. Middle-out reasoning as part of proof planning was first suggested by Bundy et al [Bundy et al 90a]. Middle-out reasoning uses variables to represent unknown terms and formulae. Unification instantiates the variables in the subsequent planning, while proof planning provides the necessary search control. Middle-out reasoning is used for synthesis by planning the verification of an unknown logic program: The program body is represented with a meta-variable. The planning results both in an instantiation of the program body and a plan for the verification of that program. If the plan executes successfully, the synthesized program is partially correct and complete. Middle-out reasoning is also used to select induction schemes. Finding an appropriate induction scheme during synthesis is difficult, because the recursion of the program, which is unknown at the outset, determines the induction in the proof. In middle-out induction, we set up a schematic step case by representing the constructors that are applied to induction variables with meta-variables. Once the step case is complete, the instantiated variables correspond to an induction appropriate to the recursion of the program. We have implemented these techniques as an extension of the proof planning system CIAM [Bundy et al 90c], called Periwinkle, and synthesized a variety of programs fully automatically." | |
| 650 | 7 | |a Bionics and artificial intelligence |2 sigle | |
| 650 | 7 | |a Computer software |2 sigle | |
| 650 | 4 | |a Automatic theorem proving | |
| 650 | 4 | |a Induction (Logic) | |
| 650 | 4 | |a Logic programming | |
| 650 | 4 | |a Reasoning | |
| 700 | 1 | |a Basin, David |e Verfasser |4 aut | |
| 700 | 1 | |a Bundy, Alan |e Verfasser |4 aut | |
| 810 | 2 | |a Department of Artificial Intelligence: DAI research paper |t University <Edinburgh> |v 729 |w (DE-604)BV010450646 |9 729 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-007394635 | ||
Datensatz im Suchindex
| _version_ | 1804125532516777984 |
|---|---|
| any_adam_object | |
| author | Kraan, Ina Basin, David Bundy, Alan |
| author_facet | Kraan, Ina Basin, David Bundy, Alan |
| author_role | aut aut aut |
| author_sort | Kraan, Ina |
| author_variant | i k ik d b db a b ab |
| building | Verbundindex |
| bvnumber | BV011043304 |
| ctrlnum | (OCoLC)34847605 (DE-599)BVBBV011043304 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>02761nam a2200373 cb4500</leader><controlfield tag="001">BV011043304</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">961107s1995 |||| 00||| engod</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)34847605</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV011043304</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">Kraan, Ina</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Middle-out reasoning for synthesis and induction</subfield><subfield code="c">Ina Kraan, David Basin and Alan Bundy</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Edinburgh</subfield><subfield code="c">1995</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">27 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">729</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Abstract: "We develop two applications of middle-out reasoning in inductive proofs: Logic program synthesis and the selection of induction schemes. Middle-out reasoning as part of proof planning was first suggested by Bundy et al [Bundy et al 90a]. Middle-out reasoning uses variables to represent unknown terms and formulae. Unification instantiates the variables in the subsequent planning, while proof planning provides the necessary search control. Middle-out reasoning is used for synthesis by planning the verification of an unknown logic program: The program body is represented with a meta-variable. The planning results both in an instantiation of the program body and a plan for the verification of that program. If the plan executes successfully, the synthesized program is partially correct and complete. Middle-out reasoning is also used to select induction schemes. Finding an appropriate induction scheme during synthesis is difficult, because the recursion of the program, which is unknown at the outset, determines the induction in the proof. In middle-out induction, we set up a schematic step case by representing the constructors that are applied to induction variables with meta-variables. Once the step case is complete, the instantiated variables correspond to an induction appropriate to the recursion of the program. We have implemented these techniques as an extension of the proof planning system CIAM [Bundy et al 90c], called Periwinkle, and synthesized a variety of programs fully automatically."</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="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">Basin, David</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Bundy, Alan</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">729</subfield><subfield code="w">(DE-604)BV010450646</subfield><subfield code="9">729</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-007394635</subfield></datafield></record></collection> |
| id | DE-604.BV011043304 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-09T18:03:03Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-007394635 |
| oclc_num | 34847605 |
| open_access_boolean | |
| owner | DE-91G DE-BY-TUM |
| owner_facet | DE-91G DE-BY-TUM |
| physical | 27 S. |
| publishDate | 1995 |
| publishDateSearch | 1995 |
| publishDateSort | 1995 |
| record_format | marc |
| series2 | University <Edinburgh> / Department of Artificial Intelligence: DAI research paper |
| spelling | Kraan, Ina Verfasser aut Middle-out reasoning for synthesis and induction Ina Kraan, David Basin and Alan Bundy Edinburgh 1995 27 S. txt rdacontent n rdamedia nc rdacarrier University <Edinburgh> / Department of Artificial Intelligence: DAI research paper 729 Abstract: "We develop two applications of middle-out reasoning in inductive proofs: Logic program synthesis and the selection of induction schemes. Middle-out reasoning as part of proof planning was first suggested by Bundy et al [Bundy et al 90a]. Middle-out reasoning uses variables to represent unknown terms and formulae. Unification instantiates the variables in the subsequent planning, while proof planning provides the necessary search control. Middle-out reasoning is used for synthesis by planning the verification of an unknown logic program: The program body is represented with a meta-variable. The planning results both in an instantiation of the program body and a plan for the verification of that program. If the plan executes successfully, the synthesized program is partially correct and complete. Middle-out reasoning is also used to select induction schemes. Finding an appropriate induction scheme during synthesis is difficult, because the recursion of the program, which is unknown at the outset, determines the induction in the proof. In middle-out induction, we set up a schematic step case by representing the constructors that are applied to induction variables with meta-variables. Once the step case is complete, the instantiated variables correspond to an induction appropriate to the recursion of the program. We have implemented these techniques as an extension of the proof planning system CIAM [Bundy et al 90c], called Periwinkle, and synthesized a variety of programs fully automatically." Bionics and artificial intelligence sigle Computer software sigle Automatic theorem proving Induction (Logic) Logic programming Reasoning Basin, David Verfasser aut Bundy, Alan Verfasser aut Department of Artificial Intelligence: DAI research paper University <Edinburgh> 729 (DE-604)BV010450646 729 |
| spellingShingle | Kraan, Ina Basin, David Bundy, Alan Middle-out reasoning for synthesis and induction Bionics and artificial intelligence sigle Computer software sigle Automatic theorem proving Induction (Logic) Logic programming Reasoning |
| title | Middle-out reasoning for synthesis and induction |
| title_auth | Middle-out reasoning for synthesis and induction |
| title_exact_search | Middle-out reasoning for synthesis and induction |
| title_full | Middle-out reasoning for synthesis and induction Ina Kraan, David Basin and Alan Bundy |
| title_fullStr | Middle-out reasoning for synthesis and induction Ina Kraan, David Basin and Alan Bundy |
| title_full_unstemmed | Middle-out reasoning for synthesis and induction Ina Kraan, David Basin and Alan Bundy |
| title_short | Middle-out reasoning for synthesis and induction |
| title_sort | middle out reasoning for synthesis and induction |
| topic | Bionics and artificial intelligence sigle Computer software sigle Automatic theorem proving Induction (Logic) Logic programming Reasoning |
| topic_facet | Bionics and artificial intelligence Computer software Automatic theorem proving Induction (Logic) Logic programming Reasoning |
| volume_link | (DE-604)BV010450646 |
| work_keys_str_mv | AT kraanina middleoutreasoningforsynthesisandinduction AT basindavid middleoutreasoningforsynthesisandinduction AT bundyalan middleoutreasoningforsynthesisandinduction |