More on unfold/fold transformations of normal programs: preservation of Fitting's semantics
Abstract: "The unfold/fold transformation system defined by Tamaki and Sato was meant for definite programs. It transforms a program into an equivalent one in the sense of both the least Herbrand model semantics and the Computed Answer Substitution semantics. Seki extended the method to normal...
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Book |
| Language: | English |
| Published: |
Amsterdam
1994
|
| Subjects: | |
| Summary: | Abstract: "The unfold/fold transformation system defined by Tamaki and Sato was meant for definite programs. It transforms a program into an equivalent one in the sense of both the least Herbrand model semantics and the Computed Answer Substitution semantics. Seki extended the method to normal programs and specialized it in order to preserve also the finite failure set. The resulting system is correct wrt nearly all the declarative semantics for normal programs. An exception is Fitting's model semantics. In this paper we consider a slight variation of Seki's method and we study its correctness wrt Fitting's semantics. We define an applicability condition for the fold operation and we show that it ensures the preservation of the considered semantics through the transformation." |
| Physical Description: | 18 S. |
Staff View
MARC
| LEADER | 00000nam a2200000 c 4500 | ||
|---|---|---|---|
| 001 | BV010157220 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | t | ||
| 008 | 950427s1994 t||| 00||| engod | ||
| 035 | |a (OCoLC)32844612 | ||
| 035 | |a (DE-599)BVBBV010157220 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-83 | ||
| 100 | 1 | |a Bossi, Annalisa |d 1948- |e Verfasser |0 (DE-588)122034961 |4 aut | |
| 245 | 1 | 0 | |a More on unfold/fold transformations of normal programs |b preservation of Fitting's semantics |c A. Bossi ; S. Etalle |
| 264 | 1 | |a Amsterdam |c 1994 | |
| 300 | |a 18 S. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 520 | 3 | |a Abstract: "The unfold/fold transformation system defined by Tamaki and Sato was meant for definite programs. It transforms a program into an equivalent one in the sense of both the least Herbrand model semantics and the Computed Answer Substitution semantics. Seki extended the method to normal programs and specialized it in order to preserve also the finite failure set. The resulting system is correct wrt nearly all the declarative semantics for normal programs. An exception is Fitting's model semantics. In this paper we consider a slight variation of Seki's method and we study its correctness wrt Fitting's semantics. We define an applicability condition for the fold operation and we show that it ensures the preservation of the considered semantics through the transformation." | |
| 650 | 4 | |a Logic programming | |
| 700 | 1 | |a Etalle, Sandro |e Verfasser |4 aut | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-006747233 | ||
Record in the Search Index
| _version_ | 1804124554262478848 |
|---|---|
| any_adam_object | |
| author | Bossi, Annalisa 1948- Etalle, Sandro |
| author_GND | (DE-588)122034961 |
| author_facet | Bossi, Annalisa 1948- Etalle, Sandro |
| author_role | aut aut |
| author_sort | Bossi, Annalisa 1948- |
| author_variant | a b ab s e se |
| building | Verbundindex |
| bvnumber | BV010157220 |
| ctrlnum | (OCoLC)32844612 (DE-599)BVBBV010157220 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01601nam a2200277 c 4500</leader><controlfield tag="001">BV010157220</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">950427s1994 t||| 00||| engod</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)32844612</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV010157220</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-83</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Bossi, Annalisa</subfield><subfield code="d">1948-</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)122034961</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">More on unfold/fold transformations of normal programs</subfield><subfield code="b">preservation of Fitting's semantics</subfield><subfield code="c">A. Bossi ; S. Etalle</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Amsterdam</subfield><subfield code="c">1994</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">18 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="520" ind1="3" ind2=" "><subfield code="a">Abstract: "The unfold/fold transformation system defined by Tamaki and Sato was meant for definite programs. It transforms a program into an equivalent one in the sense of both the least Herbrand model semantics and the Computed Answer Substitution semantics. Seki extended the method to normal programs and specialized it in order to preserve also the finite failure set. The resulting system is correct wrt nearly all the declarative semantics for normal programs. An exception is Fitting's model semantics. In this paper we consider a slight variation of Seki's method and we study its correctness wrt Fitting's semantics. We define an applicability condition for the fold operation and we show that it ensures the preservation of the considered semantics through the transformation."</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Logic programming</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Etalle, Sandro</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-006747233</subfield></datafield></record></collection> |
| id | DE-604.BV010157220 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-09T17:47:30Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-006747233 |
| oclc_num | 32844612 |
| open_access_boolean | |
| owner | DE-83 |
| owner_facet | DE-83 |
| physical | 18 S. |
| publishDate | 1994 |
| publishDateSearch | 1994 |
| publishDateSort | 1994 |
| record_format | marc |
| spelling | Bossi, Annalisa 1948- Verfasser (DE-588)122034961 aut More on unfold/fold transformations of normal programs preservation of Fitting's semantics A. Bossi ; S. Etalle Amsterdam 1994 18 S. txt rdacontent n rdamedia nc rdacarrier Abstract: "The unfold/fold transformation system defined by Tamaki and Sato was meant for definite programs. It transforms a program into an equivalent one in the sense of both the least Herbrand model semantics and the Computed Answer Substitution semantics. Seki extended the method to normal programs and specialized it in order to preserve also the finite failure set. The resulting system is correct wrt nearly all the declarative semantics for normal programs. An exception is Fitting's model semantics. In this paper we consider a slight variation of Seki's method and we study its correctness wrt Fitting's semantics. We define an applicability condition for the fold operation and we show that it ensures the preservation of the considered semantics through the transformation." Logic programming Etalle, Sandro Verfasser aut |
| spellingShingle | Bossi, Annalisa 1948- Etalle, Sandro More on unfold/fold transformations of normal programs preservation of Fitting's semantics Logic programming |
| title | More on unfold/fold transformations of normal programs preservation of Fitting's semantics |
| title_auth | More on unfold/fold transformations of normal programs preservation of Fitting's semantics |
| title_exact_search | More on unfold/fold transformations of normal programs preservation of Fitting's semantics |
| title_full | More on unfold/fold transformations of normal programs preservation of Fitting's semantics A. Bossi ; S. Etalle |
| title_fullStr | More on unfold/fold transformations of normal programs preservation of Fitting's semantics A. Bossi ; S. Etalle |
| title_full_unstemmed | More on unfold/fold transformations of normal programs preservation of Fitting's semantics A. Bossi ; S. Etalle |
| title_short | More on unfold/fold transformations of normal programs |
| title_sort | more on unfold fold transformations of normal programs preservation of fitting s semantics |
| title_sub | preservation of Fitting's semantics |
| topic | Logic programming |
| topic_facet | Logic programming |
| work_keys_str_mv | AT bossiannalisa moreonunfoldfoldtransformationsofnormalprogramspreservationoffittingssemantics AT etallesandro moreonunfoldfoldtransformationsofnormalprogramspreservationoffittingssemantics |