Higher order generalization and its application in program verification
Abstract Generalization is a fundamental operation of inductive inference. While first order syntactic generalization (anti–unification) is well understood, its various extensions are often needed in applications. This paper discusses syntactic higher order generalization in a higher order language...
Ausführliche Beschreibung
Gespeichert in:
| Autor*in: |
Lu, Jianguo [verfasserIn] |
|---|
| Format: |
Artikel |
|---|---|
| Sprache: |
Englisch |
| Erschienen: |
2000 |
|---|
| Schlagwörter: |
|---|
| Anmerkung: |
© Kluwer Academic Publishers 2000 |
|---|
| Übergeordnetes Werk: |
Enthalten in: Annals of mathematics and artificial intelligence - Kluwer Academic Publishers, 1990, 28(2000), 1-4 vom: Okt., Seite 107-126 |
|---|---|
| Übergeordnetes Werk: |
volume:28 ; year:2000 ; number:1-4 ; month:10 ; pages:107-126 |
| Links: |
|---|
| DOI / URN: |
10.1023/A:1018952121991 |
|---|
| Katalog-ID: |
OLC2041499842 |
|---|
| LEADER | 01000caa a22002652 4500 | ||
|---|---|---|---|
| 001 | OLC2041499842 | ||
| 003 | DE-627 | ||
| 005 | 20230502200208.0 | ||
| 007 | tu | ||
| 008 | 200820s2000 xx ||||| 00| ||eng c | ||
| 024 | 7 | |a 10.1023/A:1018952121991 |2 doi | |
| 035 | |a (DE-627)OLC2041499842 | ||
| 035 | |a (DE-He213)A:1018952121991-p | ||
| 040 | |a DE-627 |b ger |c DE-627 |e rakwb | ||
| 041 | |a eng | ||
| 082 | 0 | 4 | |a 510 |a 004 |q VZ |
| 084 | |a 17,1 |2 ssgn | ||
| 100 | 1 | |a Lu, Jianguo |e verfasserin |4 aut | |
| 245 | 1 | 0 | |a Higher order generalization and its application in program verification |
| 264 | 1 | |c 2000 | |
| 336 | |a Text |b txt |2 rdacontent | ||
| 337 | |a ohne Hilfsmittel zu benutzen |b n |2 rdamedia | ||
| 338 | |a Band |b nc |2 rdacarrier | ||
| 500 | |a © Kluwer Academic Publishers 2000 | ||
| 520 | |a Abstract Generalization is a fundamental operation of inductive inference. While first order syntactic generalization (anti–unification) is well understood, its various extensions are often needed in applications. This paper discusses syntactic higher order generalization in a higher order language λ2 [1]. Based on the application ordering, we prove that least general generalization exists for any two terms and is unique up to renaming. An algorithm to compute the least general generalization is also presented. To illustrate its usefulness, we propose a program verification system based on higher order generalization that can reuse the proofs of similar programs. | ||
| 650 | 4 | |a General Generalization | |
| 650 | 4 | |a Free Variable | |
| 650 | 4 | |a Inductive Inference | |
| 650 | 4 | |a Inductive Logic Programming | |
| 650 | 4 | |a Generalization Algorithm | |
| 700 | 1 | |a Mylopoulos, John |4 aut | |
| 700 | 1 | |a Harao, Masateru |4 aut | |
| 700 | 1 | |a Hagiya, Masami |4 aut | |
| 773 | 0 | 8 | |i Enthalten in |t Annals of mathematics and artificial intelligence |d Kluwer Academic Publishers, 1990 |g 28(2000), 1-4 vom: Okt., Seite 107-126 |w (DE-627)130904104 |w (DE-600)1045926-1 |w (DE-576)02499622X |x 1012-2443 |7 nnns |
| 773 | 1 | 8 | |g volume:28 |g year:2000 |g number:1-4 |g month:10 |g pages:107-126 |
| 856 | 4 | 1 | |u https://doi.org/10.1023/A:1018952121991 |z lizenzpflichtig |3 Volltext |
| 912 | |a GBV_USEFLAG_A | ||
| 912 | |a SYSFLAG_A | ||
| 912 | |a GBV_OLC | ||
| 912 | |a SSG-OLC-MAT | ||
| 912 | |a SSG-OPC-MAT | ||
| 912 | |a GBV_ILN_40 | ||
| 912 | |a GBV_ILN_70 | ||
| 912 | |a GBV_ILN_2190 | ||
| 912 | |a GBV_ILN_2244 | ||
| 912 | |a GBV_ILN_4277 | ||
| 912 | |a GBV_ILN_4313 | ||
| 951 | |a AR | ||
| 952 | |d 28 |j 2000 |e 1-4 |c 10 |h 107-126 | ||
| author_variant |
j l jl j m jm m h mh m h mh |
|---|---|
| matchkey_str |
article:10122443:2000----::ihrregnrlztoadtapiainn |
| hierarchy_sort_str |
2000 |
| publishDate |
2000 |
| allfields |
10.1023/A:1018952121991 doi (DE-627)OLC2041499842 (DE-He213)A:1018952121991-p DE-627 ger DE-627 rakwb eng 510 004 VZ 17,1 ssgn Lu, Jianguo verfasserin aut Higher order generalization and its application in program verification 2000 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © Kluwer Academic Publishers 2000 Abstract Generalization is a fundamental operation of inductive inference. While first order syntactic generalization (anti–unification) is well understood, its various extensions are often needed in applications. This paper discusses syntactic higher order generalization in a higher order language λ2 [1]. Based on the application ordering, we prove that least general generalization exists for any two terms and is unique up to renaming. An algorithm to compute the least general generalization is also presented. To illustrate its usefulness, we propose a program verification system based on higher order generalization that can reuse the proofs of similar programs. General Generalization Free Variable Inductive Inference Inductive Logic Programming Generalization Algorithm Mylopoulos, John aut Harao, Masateru aut Hagiya, Masami aut Enthalten in Annals of mathematics and artificial intelligence Kluwer Academic Publishers, 1990 28(2000), 1-4 vom: Okt., Seite 107-126 (DE-627)130904104 (DE-600)1045926-1 (DE-576)02499622X 1012-2443 nnns volume:28 year:2000 number:1-4 month:10 pages:107-126 https://doi.org/10.1023/A:1018952121991 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MAT SSG-OPC-MAT GBV_ILN_40 GBV_ILN_70 GBV_ILN_2190 GBV_ILN_2244 GBV_ILN_4277 GBV_ILN_4313 AR 28 2000 1-4 10 107-126 |
| spelling |
10.1023/A:1018952121991 doi (DE-627)OLC2041499842 (DE-He213)A:1018952121991-p DE-627 ger DE-627 rakwb eng 510 004 VZ 17,1 ssgn Lu, Jianguo verfasserin aut Higher order generalization and its application in program verification 2000 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © Kluwer Academic Publishers 2000 Abstract Generalization is a fundamental operation of inductive inference. While first order syntactic generalization (anti–unification) is well understood, its various extensions are often needed in applications. This paper discusses syntactic higher order generalization in a higher order language λ2 [1]. Based on the application ordering, we prove that least general generalization exists for any two terms and is unique up to renaming. An algorithm to compute the least general generalization is also presented. To illustrate its usefulness, we propose a program verification system based on higher order generalization that can reuse the proofs of similar programs. General Generalization Free Variable Inductive Inference Inductive Logic Programming Generalization Algorithm Mylopoulos, John aut Harao, Masateru aut Hagiya, Masami aut Enthalten in Annals of mathematics and artificial intelligence Kluwer Academic Publishers, 1990 28(2000), 1-4 vom: Okt., Seite 107-126 (DE-627)130904104 (DE-600)1045926-1 (DE-576)02499622X 1012-2443 nnns volume:28 year:2000 number:1-4 month:10 pages:107-126 https://doi.org/10.1023/A:1018952121991 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MAT SSG-OPC-MAT GBV_ILN_40 GBV_ILN_70 GBV_ILN_2190 GBV_ILN_2244 GBV_ILN_4277 GBV_ILN_4313 AR 28 2000 1-4 10 107-126 |
| allfields_unstemmed |
10.1023/A:1018952121991 doi (DE-627)OLC2041499842 (DE-He213)A:1018952121991-p DE-627 ger DE-627 rakwb eng 510 004 VZ 17,1 ssgn Lu, Jianguo verfasserin aut Higher order generalization and its application in program verification 2000 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © Kluwer Academic Publishers 2000 Abstract Generalization is a fundamental operation of inductive inference. While first order syntactic generalization (anti–unification) is well understood, its various extensions are often needed in applications. This paper discusses syntactic higher order generalization in a higher order language λ2 [1]. Based on the application ordering, we prove that least general generalization exists for any two terms and is unique up to renaming. An algorithm to compute the least general generalization is also presented. To illustrate its usefulness, we propose a program verification system based on higher order generalization that can reuse the proofs of similar programs. General Generalization Free Variable Inductive Inference Inductive Logic Programming Generalization Algorithm Mylopoulos, John aut Harao, Masateru aut Hagiya, Masami aut Enthalten in Annals of mathematics and artificial intelligence Kluwer Academic Publishers, 1990 28(2000), 1-4 vom: Okt., Seite 107-126 (DE-627)130904104 (DE-600)1045926-1 (DE-576)02499622X 1012-2443 nnns volume:28 year:2000 number:1-4 month:10 pages:107-126 https://doi.org/10.1023/A:1018952121991 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MAT SSG-OPC-MAT GBV_ILN_40 GBV_ILN_70 GBV_ILN_2190 GBV_ILN_2244 GBV_ILN_4277 GBV_ILN_4313 AR 28 2000 1-4 10 107-126 |
| allfieldsGer |
10.1023/A:1018952121991 doi (DE-627)OLC2041499842 (DE-He213)A:1018952121991-p DE-627 ger DE-627 rakwb eng 510 004 VZ 17,1 ssgn Lu, Jianguo verfasserin aut Higher order generalization and its application in program verification 2000 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © Kluwer Academic Publishers 2000 Abstract Generalization is a fundamental operation of inductive inference. While first order syntactic generalization (anti–unification) is well understood, its various extensions are often needed in applications. This paper discusses syntactic higher order generalization in a higher order language λ2 [1]. Based on the application ordering, we prove that least general generalization exists for any two terms and is unique up to renaming. An algorithm to compute the least general generalization is also presented. To illustrate its usefulness, we propose a program verification system based on higher order generalization that can reuse the proofs of similar programs. General Generalization Free Variable Inductive Inference Inductive Logic Programming Generalization Algorithm Mylopoulos, John aut Harao, Masateru aut Hagiya, Masami aut Enthalten in Annals of mathematics and artificial intelligence Kluwer Academic Publishers, 1990 28(2000), 1-4 vom: Okt., Seite 107-126 (DE-627)130904104 (DE-600)1045926-1 (DE-576)02499622X 1012-2443 nnns volume:28 year:2000 number:1-4 month:10 pages:107-126 https://doi.org/10.1023/A:1018952121991 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MAT SSG-OPC-MAT GBV_ILN_40 GBV_ILN_70 GBV_ILN_2190 GBV_ILN_2244 GBV_ILN_4277 GBV_ILN_4313 AR 28 2000 1-4 10 107-126 |
| allfieldsSound |
10.1023/A:1018952121991 doi (DE-627)OLC2041499842 (DE-He213)A:1018952121991-p DE-627 ger DE-627 rakwb eng 510 004 VZ 17,1 ssgn Lu, Jianguo verfasserin aut Higher order generalization and its application in program verification 2000 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © Kluwer Academic Publishers 2000 Abstract Generalization is a fundamental operation of inductive inference. While first order syntactic generalization (anti–unification) is well understood, its various extensions are often needed in applications. This paper discusses syntactic higher order generalization in a higher order language λ2 [1]. Based on the application ordering, we prove that least general generalization exists for any two terms and is unique up to renaming. An algorithm to compute the least general generalization is also presented. To illustrate its usefulness, we propose a program verification system based on higher order generalization that can reuse the proofs of similar programs. General Generalization Free Variable Inductive Inference Inductive Logic Programming Generalization Algorithm Mylopoulos, John aut Harao, Masateru aut Hagiya, Masami aut Enthalten in Annals of mathematics and artificial intelligence Kluwer Academic Publishers, 1990 28(2000), 1-4 vom: Okt., Seite 107-126 (DE-627)130904104 (DE-600)1045926-1 (DE-576)02499622X 1012-2443 nnns volume:28 year:2000 number:1-4 month:10 pages:107-126 https://doi.org/10.1023/A:1018952121991 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MAT SSG-OPC-MAT GBV_ILN_40 GBV_ILN_70 GBV_ILN_2190 GBV_ILN_2244 GBV_ILN_4277 GBV_ILN_4313 AR 28 2000 1-4 10 107-126 |
| language |
English |
| source |
Enthalten in Annals of mathematics and artificial intelligence 28(2000), 1-4 vom: Okt., Seite 107-126 volume:28 year:2000 number:1-4 month:10 pages:107-126 |
| sourceStr |
Enthalten in Annals of mathematics and artificial intelligence 28(2000), 1-4 vom: Okt., Seite 107-126 volume:28 year:2000 number:1-4 month:10 pages:107-126 |
| format_phy_str_mv |
Article |
| institution |
findex.gbv.de |
| topic_facet |
General Generalization Free Variable Inductive Inference Inductive Logic Programming Generalization Algorithm |
| dewey-raw |
510 |
| isfreeaccess_bool |
false |
| container_title |
Annals of mathematics and artificial intelligence |
| authorswithroles_txt_mv |
Lu, Jianguo @@aut@@ Mylopoulos, John @@aut@@ Harao, Masateru @@aut@@ Hagiya, Masami @@aut@@ |
| publishDateDaySort_date |
2000-10-01T00:00:00Z |
| hierarchy_top_id |
130904104 |
| dewey-sort |
3510 |
| id |
OLC2041499842 |
| language_de |
englisch |
| fullrecord |
<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01000caa a22002652 4500</leader><controlfield tag="001">OLC2041499842</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20230502200208.0</controlfield><controlfield tag="007">tu</controlfield><controlfield tag="008">200820s2000 xx ||||| 00| ||eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1023/A:1018952121991</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)OLC2041499842</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-He213)A:1018952121991-p</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-627</subfield><subfield code="b">ger</subfield><subfield code="c">DE-627</subfield><subfield code="e">rakwb</subfield></datafield><datafield tag="041" ind1=" " ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="082" ind1="0" ind2="4"><subfield code="a">510</subfield><subfield code="a">004</subfield><subfield code="q">VZ</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">17,1</subfield><subfield code="2">ssgn</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Lu, Jianguo</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Higher order generalization and its application in program verification</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2000</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">Text</subfield><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">ohne Hilfsmittel zu benutzen</subfield><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">Band</subfield><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">© Kluwer Academic Publishers 2000</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">Abstract Generalization is a fundamental operation of inductive inference. While first order syntactic generalization (anti–unification) is well understood, its various extensions are often needed in applications. This paper discusses syntactic higher order generalization in a higher order language λ2 [1]. Based on the application ordering, we prove that least general generalization exists for any two terms and is unique up to renaming. An algorithm to compute the least general generalization is also presented. To illustrate its usefulness, we propose a program verification system based on higher order generalization that can reuse the proofs of similar programs.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">General Generalization</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Free Variable</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Inductive Inference</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Inductive Logic Programming</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Generalization Algorithm</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Mylopoulos, John</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Harao, Masateru</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Hagiya, Masami</subfield><subfield code="4">aut</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Enthalten in</subfield><subfield code="t">Annals of mathematics and artificial intelligence</subfield><subfield code="d">Kluwer Academic Publishers, 1990</subfield><subfield code="g">28(2000), 1-4 vom: Okt., Seite 107-126</subfield><subfield code="w">(DE-627)130904104</subfield><subfield code="w">(DE-600)1045926-1</subfield><subfield code="w">(DE-576)02499622X</subfield><subfield code="x">1012-2443</subfield><subfield code="7">nnns</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:28</subfield><subfield code="g">year:2000</subfield><subfield code="g">number:1-4</subfield><subfield code="g">month:10</subfield><subfield code="g">pages:107-126</subfield></datafield><datafield tag="856" ind1="4" ind2="1"><subfield code="u">https://doi.org/10.1023/A:1018952121991</subfield><subfield code="z">lizenzpflichtig</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_USEFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SYSFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_OLC</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OLC-MAT</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OPC-MAT</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_40</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_70</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2190</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2244</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4277</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4313</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">28</subfield><subfield code="j">2000</subfield><subfield code="e">1-4</subfield><subfield code="c">10</subfield><subfield code="h">107-126</subfield></datafield></record></collection>
|
| author |
Lu, Jianguo |
| spellingShingle |
Lu, Jianguo ddc 510 ssgn 17,1 misc General Generalization misc Free Variable misc Inductive Inference misc Inductive Logic Programming misc Generalization Algorithm Higher order generalization and its application in program verification |
| authorStr |
Lu, Jianguo |
| ppnlink_with_tag_str_mv |
@@773@@(DE-627)130904104 |
| format |
Article |
| dewey-ones |
510 - Mathematics 004 - Data processing & computer science |
| delete_txt_mv |
keep |
| author_role |
aut aut aut aut |
| collection |
OLC |
| remote_str |
false |
| illustrated |
Not Illustrated |
| issn |
1012-2443 |
| topic_title |
510 004 VZ 17,1 ssgn Higher order generalization and its application in program verification General Generalization Free Variable Inductive Inference Inductive Logic Programming Generalization Algorithm |
| topic |
ddc 510 ssgn 17,1 misc General Generalization misc Free Variable misc Inductive Inference misc Inductive Logic Programming misc Generalization Algorithm |
| topic_unstemmed |
ddc 510 ssgn 17,1 misc General Generalization misc Free Variable misc Inductive Inference misc Inductive Logic Programming misc Generalization Algorithm |
| topic_browse |
ddc 510 ssgn 17,1 misc General Generalization misc Free Variable misc Inductive Inference misc Inductive Logic Programming misc Generalization Algorithm |
| format_facet |
Aufsätze Gedruckte Aufsätze |
| format_main_str_mv |
Text Zeitschrift/Artikel |
| carriertype_str_mv |
nc |
| hierarchy_parent_title |
Annals of mathematics and artificial intelligence |
| hierarchy_parent_id |
130904104 |
| dewey-tens |
510 - Mathematics 000 - Computer science, knowledge & systems |
| hierarchy_top_title |
Annals of mathematics and artificial intelligence |
| isfreeaccess_txt |
false |
| familylinks_str_mv |
(DE-627)130904104 (DE-600)1045926-1 (DE-576)02499622X |
| title |
Higher order generalization and its application in program verification |
| ctrlnum |
(DE-627)OLC2041499842 (DE-He213)A:1018952121991-p |
| title_full |
Higher order generalization and its application in program verification |
| author_sort |
Lu, Jianguo |
| journal |
Annals of mathematics and artificial intelligence |
| journalStr |
Annals of mathematics and artificial intelligence |
| lang_code |
eng |
| isOA_bool |
false |
| dewey-hundreds |
500 - Science 000 - Computer science, information & general works |
| recordtype |
marc |
| publishDateSort |
2000 |
| contenttype_str_mv |
txt |
| container_start_page |
107 |
| author_browse |
Lu, Jianguo Mylopoulos, John Harao, Masateru Hagiya, Masami |
| container_volume |
28 |
| class |
510 004 VZ 17,1 ssgn |
| format_se |
Aufsätze |
| author-letter |
Lu, Jianguo |
| doi_str_mv |
10.1023/A:1018952121991 |
| dewey-full |
510 004 |
| title_sort |
higher order generalization and its application in program verification |
| title_auth |
Higher order generalization and its application in program verification |
| abstract |
Abstract Generalization is a fundamental operation of inductive inference. While first order syntactic generalization (anti–unification) is well understood, its various extensions are often needed in applications. This paper discusses syntactic higher order generalization in a higher order language λ2 [1]. Based on the application ordering, we prove that least general generalization exists for any two terms and is unique up to renaming. An algorithm to compute the least general generalization is also presented. To illustrate its usefulness, we propose a program verification system based on higher order generalization that can reuse the proofs of similar programs. © Kluwer Academic Publishers 2000 |
| abstractGer |
Abstract Generalization is a fundamental operation of inductive inference. While first order syntactic generalization (anti–unification) is well understood, its various extensions are often needed in applications. This paper discusses syntactic higher order generalization in a higher order language λ2 [1]. Based on the application ordering, we prove that least general generalization exists for any two terms and is unique up to renaming. An algorithm to compute the least general generalization is also presented. To illustrate its usefulness, we propose a program verification system based on higher order generalization that can reuse the proofs of similar programs. © Kluwer Academic Publishers 2000 |
| abstract_unstemmed |
Abstract Generalization is a fundamental operation of inductive inference. While first order syntactic generalization (anti–unification) is well understood, its various extensions are often needed in applications. This paper discusses syntactic higher order generalization in a higher order language λ2 [1]. Based on the application ordering, we prove that least general generalization exists for any two terms and is unique up to renaming. An algorithm to compute the least general generalization is also presented. To illustrate its usefulness, we propose a program verification system based on higher order generalization that can reuse the proofs of similar programs. © Kluwer Academic Publishers 2000 |
| collection_details |
GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MAT SSG-OPC-MAT GBV_ILN_40 GBV_ILN_70 GBV_ILN_2190 GBV_ILN_2244 GBV_ILN_4277 GBV_ILN_4313 |
| container_issue |
1-4 |
| title_short |
Higher order generalization and its application in program verification |
| url |
https://doi.org/10.1023/A:1018952121991 |
| remote_bool |
false |
| author2 |
Mylopoulos, John Harao, Masateru Hagiya, Masami |
| author2Str |
Mylopoulos, John Harao, Masateru Hagiya, Masami |
| ppnlink |
130904104 |
| mediatype_str_mv |
n |
| isOA_txt |
false |
| hochschulschrift_bool |
false |
| doi_str |
10.1023/A:1018952121991 |
| up_date |
2024-07-04T04:53:27.937Z |
| _version_ |
1803622870350299136 |
| fullrecord_marcxml |
<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01000caa a22002652 4500</leader><controlfield tag="001">OLC2041499842</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20230502200208.0</controlfield><controlfield tag="007">tu</controlfield><controlfield tag="008">200820s2000 xx ||||| 00| ||eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1023/A:1018952121991</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)OLC2041499842</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-He213)A:1018952121991-p</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-627</subfield><subfield code="b">ger</subfield><subfield code="c">DE-627</subfield><subfield code="e">rakwb</subfield></datafield><datafield tag="041" ind1=" " ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="082" ind1="0" ind2="4"><subfield code="a">510</subfield><subfield code="a">004</subfield><subfield code="q">VZ</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">17,1</subfield><subfield code="2">ssgn</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Lu, Jianguo</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Higher order generalization and its application in program verification</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2000</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">Text</subfield><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">ohne Hilfsmittel zu benutzen</subfield><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">Band</subfield><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">© Kluwer Academic Publishers 2000</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">Abstract Generalization is a fundamental operation of inductive inference. While first order syntactic generalization (anti–unification) is well understood, its various extensions are often needed in applications. This paper discusses syntactic higher order generalization in a higher order language λ2 [1]. Based on the application ordering, we prove that least general generalization exists for any two terms and is unique up to renaming. An algorithm to compute the least general generalization is also presented. To illustrate its usefulness, we propose a program verification system based on higher order generalization that can reuse the proofs of similar programs.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">General Generalization</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Free Variable</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Inductive Inference</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Inductive Logic Programming</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Generalization Algorithm</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Mylopoulos, John</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Harao, Masateru</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Hagiya, Masami</subfield><subfield code="4">aut</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Enthalten in</subfield><subfield code="t">Annals of mathematics and artificial intelligence</subfield><subfield code="d">Kluwer Academic Publishers, 1990</subfield><subfield code="g">28(2000), 1-4 vom: Okt., Seite 107-126</subfield><subfield code="w">(DE-627)130904104</subfield><subfield code="w">(DE-600)1045926-1</subfield><subfield code="w">(DE-576)02499622X</subfield><subfield code="x">1012-2443</subfield><subfield code="7">nnns</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:28</subfield><subfield code="g">year:2000</subfield><subfield code="g">number:1-4</subfield><subfield code="g">month:10</subfield><subfield code="g">pages:107-126</subfield></datafield><datafield tag="856" ind1="4" ind2="1"><subfield code="u">https://doi.org/10.1023/A:1018952121991</subfield><subfield code="z">lizenzpflichtig</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_USEFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SYSFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_OLC</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OLC-MAT</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OPC-MAT</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_40</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_70</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2190</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2244</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4277</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4313</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">28</subfield><subfield code="j">2000</subfield><subfield code="e">1-4</subfield><subfield code="c">10</subfield><subfield code="h">107-126</subfield></datafield></record></collection>
|
| score |
7.4009037 |