A closer look at declarative interpretations:
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Book |
| Language: | English |
| Published: |
Amsterdam
1994
|
| Series: | Centrum voor Wiskunde en Informatica <Amsterdam> / Department of Computer Science: Report CS
94,70 |
| Subjects: | |
| Abstract: | Abstract: "Three semantics have been proposed as the most promising candidates for a declarative interpretation for logic programs and pure Prolog programs: the least Herbrand model, the least term model, i.e. the C-semantics, and the S-semantics. Previous results show that a strictly increasing information ordering between these semantics exists for the class of all programs. In particular, the S-semantics allows us to model the computed answer substitutions, which is not the case for the other two. We study here the relationship between these three semantics for specific classes of programs. We show that for a large class of programs (which is Turing complete) these three semantics are isomorphic. As a consequence, given a query, we can extract from the least Herbrand model of a program in this class all computed answer substitutions. However, for specific programs the least Herbrand model is tedious to construct and reason about because it contains 'ill-typed' facts. Therefore we propose a fourth semantics which associates with a 'correctly- typed' program the 'well-typed' subset of its least Herbrand model. This semantics is used to reason about partial correctness of correctly typed programs. The results are extended to programs with arithmetic." |
| Physical Description: | 31 S. |
Staff View
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV010162105 | ||
| 003 | DE-604 | ||
| 005 | 19960325 | ||
| 007 | t| | ||
| 008 | 950428s1994 xx |||| 00||| engod | ||
| 035 | |a (OCoLC)33099176 | ||
| 035 | |a (DE-599)BVBBV010162105 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 100 | 1 | |a Apt, Krzysztof R. |d 1949- |e Verfasser |0 (DE-588)110139763 |4 aut | |
| 245 | 1 | 0 | |a A closer look at declarative interpretations |c K. R. Apt ; M. Gabbrielli ; D. Pedreschi |
| 264 | 1 | |a Amsterdam |c 1994 | |
| 300 | |a 31 S. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a Centrum voor Wiskunde en Informatica <Amsterdam> / Department of Computer Science: Report CS |v 94,70 | |
| 520 | 3 | |a Abstract: "Three semantics have been proposed as the most promising candidates for a declarative interpretation for logic programs and pure Prolog programs: the least Herbrand model, the least term model, i.e. the C-semantics, and the S-semantics. Previous results show that a strictly increasing information ordering between these semantics exists for the class of all programs. In particular, the S-semantics allows us to model the computed answer substitutions, which is not the case for the other two. We study here the relationship between these three semantics for specific classes of programs. We show that for a large class of programs (which is Turing complete) these three semantics are isomorphic. As a consequence, given a query, we can extract from the least Herbrand model of a program in this class all computed answer substitutions. However, for specific programs the least Herbrand model is tedious to construct and reason about because it contains 'ill-typed' facts. Therefore we propose a fourth semantics which associates with a 'correctly- typed' program the 'well-typed' subset of its least Herbrand model. This semantics is used to reason about partial correctness of correctly typed programs. The results are extended to programs with arithmetic." | |
| 650 | 4 | |a Logic programming | |
| 700 | 1 | |a Gabbrielli, Maurizio |e Verfasser |4 aut | |
| 700 | 1 | |a Pedreschi, Dino |e Verfasser |4 aut | |
| 810 | 2 | |a Department of Computer Science: Report CS |t Centrum voor Wiskunde en Informatica <Amsterdam> |v 94,70 |w (DE-604)BV008928356 |9 94,70 | |
| 943 | 1 | |a oai:aleph.bib-bvb.de:BVB01-006748570 | |
Record in the Search Index
| _version_ | 1818952355880632320 |
|---|---|
| any_adam_object | |
| author | Apt, Krzysztof R. 1949- Gabbrielli, Maurizio Pedreschi, Dino |
| author_GND | (DE-588)110139763 |
| author_facet | Apt, Krzysztof R. 1949- Gabbrielli, Maurizio Pedreschi, Dino |
| author_role | aut aut aut |
| author_sort | Apt, Krzysztof R. 1949- |
| author_variant | k r a kr kra m g mg d p dp |
| building | Verbundindex |
| bvnumber | BV010162105 |
| ctrlnum | (OCoLC)33099176 (DE-599)BVBBV010162105 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>02356nam a2200301 cb4500</leader><controlfield tag="001">BV010162105</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">19960325 </controlfield><controlfield tag="007">t|</controlfield><controlfield tag="008">950428s1994 xx |||| 00||| engod</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)33099176</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV010162105</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="100" ind1="1" ind2=" "><subfield code="a">Apt, Krzysztof R.</subfield><subfield code="d">1949-</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)110139763</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">A closer look at declarative interpretations</subfield><subfield code="c">K. R. Apt ; M. Gabbrielli ; D. Pedreschi</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">31 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">Centrum voor Wiskunde en Informatica <Amsterdam> / Department of Computer Science: Report CS</subfield><subfield code="v">94,70</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Abstract: "Three semantics have been proposed as the most promising candidates for a declarative interpretation for logic programs and pure Prolog programs: the least Herbrand model, the least term model, i.e. the C-semantics, and the S-semantics. Previous results show that a strictly increasing information ordering between these semantics exists for the class of all programs. In particular, the S-semantics allows us to model the computed answer substitutions, which is not the case for the other two. We study here the relationship between these three semantics for specific classes of programs. We show that for a large class of programs (which is Turing complete) these three semantics are isomorphic. As a consequence, given a query, we can extract from the least Herbrand model of a program in this class all computed answer substitutions. However, for specific programs the least Herbrand model is tedious to construct and reason about because it contains 'ill-typed' facts. Therefore we propose a fourth semantics which associates with a 'correctly- typed' program the 'well-typed' subset of its least Herbrand model. This semantics is used to reason about partial correctness of correctly typed programs. The results are extended to programs with arithmetic."</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Logic programming</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Gabbrielli, Maurizio</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Pedreschi, Dino</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="810" ind1="2" ind2=" "><subfield code="a">Department of Computer Science: Report CS</subfield><subfield code="t">Centrum voor Wiskunde en Informatica <Amsterdam></subfield><subfield code="v">94,70</subfield><subfield code="w">(DE-604)BV008928356</subfield><subfield code="9">94,70</subfield></datafield><datafield tag="943" ind1="1" ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-006748570</subfield></datafield></record></collection> |
| id | DE-604.BV010162105 |
| illustrated | Not Illustrated |
| indexdate | 2024-12-20T09:49:04Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-006748570 |
| oclc_num | 33099176 |
| open_access_boolean | |
| physical | 31 S. |
| publishDate | 1994 |
| publishDateSearch | 1994 |
| publishDateSort | 1994 |
| record_format | marc |
| series2 | Centrum voor Wiskunde en Informatica <Amsterdam> / Department of Computer Science: Report CS |
| spelling | Apt, Krzysztof R. 1949- Verfasser (DE-588)110139763 aut A closer look at declarative interpretations K. R. Apt ; M. Gabbrielli ; D. Pedreschi Amsterdam 1994 31 S. txt rdacontent n rdamedia nc rdacarrier Centrum voor Wiskunde en Informatica <Amsterdam> / Department of Computer Science: Report CS 94,70 Abstract: "Three semantics have been proposed as the most promising candidates for a declarative interpretation for logic programs and pure Prolog programs: the least Herbrand model, the least term model, i.e. the C-semantics, and the S-semantics. Previous results show that a strictly increasing information ordering between these semantics exists for the class of all programs. In particular, the S-semantics allows us to model the computed answer substitutions, which is not the case for the other two. We study here the relationship between these three semantics for specific classes of programs. We show that for a large class of programs (which is Turing complete) these three semantics are isomorphic. As a consequence, given a query, we can extract from the least Herbrand model of a program in this class all computed answer substitutions. However, for specific programs the least Herbrand model is tedious to construct and reason about because it contains 'ill-typed' facts. Therefore we propose a fourth semantics which associates with a 'correctly- typed' program the 'well-typed' subset of its least Herbrand model. This semantics is used to reason about partial correctness of correctly typed programs. The results are extended to programs with arithmetic." Logic programming Gabbrielli, Maurizio Verfasser aut Pedreschi, Dino Verfasser aut Department of Computer Science: Report CS Centrum voor Wiskunde en Informatica <Amsterdam> 94,70 (DE-604)BV008928356 94,70 |
| spellingShingle | Apt, Krzysztof R. 1949- Gabbrielli, Maurizio Pedreschi, Dino A closer look at declarative interpretations Logic programming |
| title | A closer look at declarative interpretations |
| title_auth | A closer look at declarative interpretations |
| title_exact_search | A closer look at declarative interpretations |
| title_full | A closer look at declarative interpretations K. R. Apt ; M. Gabbrielli ; D. Pedreschi |
| title_fullStr | A closer look at declarative interpretations K. R. Apt ; M. Gabbrielli ; D. Pedreschi |
| title_full_unstemmed | A closer look at declarative interpretations K. R. Apt ; M. Gabbrielli ; D. Pedreschi |
| title_short | A closer look at declarative interpretations |
| title_sort | a closer look at declarative interpretations |
| topic | Logic programming |
| topic_facet | Logic programming |
| volume_link | (DE-604)BV008928356 |
| work_keys_str_mv | AT aptkrzysztofr acloserlookatdeclarativeinterpretations AT gabbriellimaurizio acloserlookatdeclarativeinterpretations AT pedreschidino acloserlookatdeclarativeinterpretations |