An algebraic semantics of Prolog program termination:
Abstract: "Formal proofs of termination properties of Prolog programs with cut are presented which make use of an algebraic process semantics of Prolog. The algebraic semantics is written in Milner's CCS. This semantics treats Prolog program components as processes which generate streams o...
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Book |
| Language: | English |
| Published: |
Edinburgh
1990
|
| Series: | University <Edinburgh> / Department of Artificial Intelligence: DAI research paper
510 |
| Subjects: | |
| Summary: | Abstract: "Formal proofs of termination properties of Prolog programs with cut are presented which make use of an algebraic process semantics of Prolog. The algebraic semantics is written in Milner's CCS. This semantics treats Prolog program components as processes which generate streams of answer substitutions. Such a characterisation of logic program computation is ideal for termination proofs because phenomena such as termination, infinite answer generation, and looping are easily modelled as streams. In addition, simple inductive proofs over streams or the structure of argument terms are readily supported This paper suggests that the process algebra approach is a promising formalism for the semantics of different computational paradigms, since sequential as well as concurrent logic program execution is axiomatisable within it. |
| Physical Description: | 24 S. |
Staff View
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV010452932 | ||
| 003 | DE-604 | ||
| 007 | t | ||
| 008 | 951027s1990 |||| 00||| engod | ||
| 035 | |a (OCoLC)24437281 | ||
| 035 | |a (DE-599)BVBBV010452932 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-91G | ||
| 100 | 1 | |a Ross, Brian J. |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a An algebraic semantics of Prolog program termination |c Brian J. Ross ; Alan Smaill |
| 264 | 1 | |a Edinburgh |c 1990 | |
| 300 | |a 24 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 510 | |
| 520 | 3 | |a Abstract: "Formal proofs of termination properties of Prolog programs with cut are presented which make use of an algebraic process semantics of Prolog. The algebraic semantics is written in Milner's CCS. This semantics treats Prolog program components as processes which generate streams of answer substitutions. Such a characterisation of logic program computation is ideal for termination proofs because phenomena such as termination, infinite answer generation, and looping are easily modelled as streams. In addition, simple inductive proofs over streams or the structure of argument terms are readily supported | |
| 520 | 3 | |a This paper suggests that the process algebra approach is a promising formalism for the semantics of different computational paradigms, since sequential as well as concurrent logic program execution is axiomatisable within it. | |
| 650 | 7 | |a Computer software |2 sigle | |
| 650 | 4 | |a Computer programs | |
| 650 | 4 | |a Prolog (Computer program language) | |
| 700 | 1 | |a Smaill, Alan |e Verfasser |4 aut | |
| 810 | 2 | |a Department of Artificial Intelligence: DAI research paper |t University <Edinburgh> |v 510 |w (DE-604)BV010450646 |9 510 | |
| 943 | 1 | |a oai:aleph.bib-bvb.de:BVB01-006965757 | |
Record in the Search Index
| _version_ | 1809403021050773504 |
|---|---|
| adam_text | |
| any_adam_object | |
| author | Ross, Brian J. Smaill, Alan |
| author_facet | Ross, Brian J. Smaill, Alan |
| author_role | aut aut |
| author_sort | Ross, Brian J. |
| author_variant | b j r bj bjr a s as |
| building | Verbundindex |
| bvnumber | BV010452932 |
| ctrlnum | (OCoLC)24437281 (DE-599)BVBBV010452932 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>00000nam a2200000 cb4500</leader><controlfield tag="001">BV010452932</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">951027s1990 |||| 00||| engod</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)24437281</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV010452932</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">Ross, Brian J.</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">An algebraic semantics of Prolog program termination</subfield><subfield code="c">Brian J. Ross ; Alan Smaill</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Edinburgh</subfield><subfield code="c">1990</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">24 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">510</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Abstract: "Formal proofs of termination properties of Prolog programs with cut are presented which make use of an algebraic process semantics of Prolog. The algebraic semantics is written in Milner's CCS. This semantics treats Prolog program components as processes which generate streams of answer substitutions. Such a characterisation of logic program computation is ideal for termination proofs because phenomena such as termination, infinite answer generation, and looping are easily modelled as streams. In addition, simple inductive proofs over streams or the structure of argument terms are readily supported</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">This paper suggests that the process algebra approach is a promising formalism for the semantics of different computational paradigms, since sequential as well as concurrent logic program execution is axiomatisable within it.</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">Computer programs</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Prolog (Computer program language)</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Smaill, 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">510</subfield><subfield code="w">(DE-604)BV010450646</subfield><subfield code="9">510</subfield></datafield><datafield tag="943" ind1="1" ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-006965757</subfield></datafield></record></collection> |
| id | DE-604.BV010452932 |
| illustrated | Not Illustrated |
| indexdate | 2024-09-06T00:06:29Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-006965757 |
| oclc_num | 24437281 |
| open_access_boolean | |
| owner | DE-91G DE-BY-TUM |
| owner_facet | DE-91G DE-BY-TUM |
| physical | 24 S. |
| publishDate | 1990 |
| publishDateSearch | 1990 |
| publishDateSort | 1990 |
| record_format | marc |
| series2 | University <Edinburgh> / Department of Artificial Intelligence: DAI research paper |
| spelling | Ross, Brian J. Verfasser aut An algebraic semantics of Prolog program termination Brian J. Ross ; Alan Smaill Edinburgh 1990 24 S. txt rdacontent n rdamedia nc rdacarrier University <Edinburgh> / Department of Artificial Intelligence: DAI research paper 510 Abstract: "Formal proofs of termination properties of Prolog programs with cut are presented which make use of an algebraic process semantics of Prolog. The algebraic semantics is written in Milner's CCS. This semantics treats Prolog program components as processes which generate streams of answer substitutions. Such a characterisation of logic program computation is ideal for termination proofs because phenomena such as termination, infinite answer generation, and looping are easily modelled as streams. In addition, simple inductive proofs over streams or the structure of argument terms are readily supported This paper suggests that the process algebra approach is a promising formalism for the semantics of different computational paradigms, since sequential as well as concurrent logic program execution is axiomatisable within it. Computer software sigle Computer programs Prolog (Computer program language) Smaill, Alan Verfasser aut Department of Artificial Intelligence: DAI research paper University <Edinburgh> 510 (DE-604)BV010450646 510 |
| spellingShingle | Ross, Brian J. Smaill, Alan An algebraic semantics of Prolog program termination Computer software sigle Computer programs Prolog (Computer program language) |
| title | An algebraic semantics of Prolog program termination |
| title_auth | An algebraic semantics of Prolog program termination |
| title_exact_search | An algebraic semantics of Prolog program termination |
| title_full | An algebraic semantics of Prolog program termination Brian J. Ross ; Alan Smaill |
| title_fullStr | An algebraic semantics of Prolog program termination Brian J. Ross ; Alan Smaill |
| title_full_unstemmed | An algebraic semantics of Prolog program termination Brian J. Ross ; Alan Smaill |
| title_short | An algebraic semantics of Prolog program termination |
| title_sort | an algebraic semantics of prolog program termination |
| topic | Computer software sigle Computer programs Prolog (Computer program language) |
| topic_facet | Computer software Computer programs Prolog (Computer program language) |
| volume_link | (DE-604)BV010450646 |
| work_keys_str_mv | AT rossbrianj analgebraicsemanticsofprologprogramtermination AT smaillalan analgebraicsemanticsofprologprogramtermination |