Unfolding and fixpoint semantics of concurrent constraint logic programs:
Abstract: "We present a new semantics for a language in the family of concurrent constraint logic languages. The semantics can be used on a notion of clause unfolding, since the language is closed under this transformation. The unfolding semantics is obtained as limit of an infinite unfolding p...
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Book |
| Language: | English |
| Published: |
Pisa
1991
|
| Series: | Università degli Studi <Pisa> / Dipartimento di Informatica: Technical report
1991,2 |
| Subjects: | |
| Summary: | Abstract: "We present a new semantics for a language in the family of concurrent constraint logic languages. The semantics can be used on a notion of clause unfolding, since the language is closed under this transformation. The unfolding semantics is obtained as limit of an infinite unfolding process. Unfolding is also used to define an immediate consequences operator, and, therefore, a fixpoint semantics in the typical logic programming style. The result of both the unfolding and the fixpoint semantics is a set of reactive behaviors, which are trees abstractly representing all the possible computations of a program, including deadlocks and finite failures." |
| Physical Description: | 44 S. |
Staff View
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV010843857 | ||
| 003 | DE-604 | ||
| 005 | 20010627 | ||
| 007 | t | ||
| 008 | 960711s1991 |||| 00||| engod | ||
| 035 | |a (OCoLC)28227700 | ||
| 035 | |a (DE-599)BVBBV010843857 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-91G | ||
| 084 | |a DAT 557f |2 stub | ||
| 084 | |a DAT 706f |2 stub | ||
| 100 | 1 | |a Gabbrielli, Maurizio |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Unfolding and fixpoint semantics of concurrent constraint logic programs |c M. Gabbrielli ; G. Levi |
| 264 | 1 | |a Pisa |c 1991 | |
| 300 | |a 44 S. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a Università degli Studi <Pisa> / Dipartimento di Informatica: Technical report |v 1991,2 | |
| 520 | 3 | |a Abstract: "We present a new semantics for a language in the family of concurrent constraint logic languages. The semantics can be used on a notion of clause unfolding, since the language is closed under this transformation. The unfolding semantics is obtained as limit of an infinite unfolding process. Unfolding is also used to define an immediate consequences operator, and, therefore, a fixpoint semantics in the typical logic programming style. The result of both the unfolding and the fixpoint semantics is a set of reactive behaviors, which are trees abstractly representing all the possible computations of a program, including deadlocks and finite failures." | |
| 650 | 4 | |a Logic programming | |
| 700 | 1 | |a Levi, Giorgio |d 1942- |e Verfasser |0 (DE-588)1077828853 |4 aut | |
| 810 | 2 | |a Dipartimento di Informatica: Technical report |t Università degli Studi <Pisa> |v 1991,2 |w (DE-604)BV010841375 |9 1991,2 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-007249060 | ||
Record in the Search Index
| _version_ | 1804125331738591232 |
|---|---|
| any_adam_object | |
| author | Gabbrielli, Maurizio Levi, Giorgio 1942- |
| author_GND | (DE-588)1077828853 |
| author_facet | Gabbrielli, Maurizio Levi, Giorgio 1942- |
| author_role | aut aut |
| author_sort | Gabbrielli, Maurizio |
| author_variant | m g mg g l gl |
| building | Verbundindex |
| bvnumber | BV010843857 |
| classification_tum | DAT 557f DAT 706f |
| ctrlnum | (OCoLC)28227700 (DE-599)BVBBV010843857 |
| discipline | Informatik |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01761nam a2200325 cb4500</leader><controlfield tag="001">BV010843857</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20010627 </controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">960711s1991 |||| 00||| engod</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)28227700</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV010843857</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="084" ind1=" " ind2=" "><subfield code="a">DAT 557f</subfield><subfield code="2">stub</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">DAT 706f</subfield><subfield code="2">stub</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Gabbrielli, Maurizio</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Unfolding and fixpoint semantics of concurrent constraint logic programs</subfield><subfield code="c">M. Gabbrielli ; G. Levi</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Pisa</subfield><subfield code="c">1991</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">44 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">Università degli Studi <Pisa> / Dipartimento di Informatica: Technical report</subfield><subfield code="v">1991,2</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Abstract: "We present a new semantics for a language in the family of concurrent constraint logic languages. The semantics can be used on a notion of clause unfolding, since the language is closed under this transformation. The unfolding semantics is obtained as limit of an infinite unfolding process. Unfolding is also used to define an immediate consequences operator, and, therefore, a fixpoint semantics in the typical logic programming style. The result of both the unfolding and the fixpoint semantics is a set of reactive behaviors, which are trees abstractly representing all the possible computations of a program, including deadlocks and finite failures."</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Logic programming</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Levi, Giorgio</subfield><subfield code="d">1942-</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)1077828853</subfield><subfield code="4">aut</subfield></datafield><datafield tag="810" ind1="2" ind2=" "><subfield code="a">Dipartimento di Informatica: Technical report</subfield><subfield code="t">Università degli Studi <Pisa></subfield><subfield code="v">1991,2</subfield><subfield code="w">(DE-604)BV010841375</subfield><subfield code="9">1991,2</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-007249060</subfield></datafield></record></collection> |
| id | DE-604.BV010843857 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-09T17:59:52Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-007249060 |
| oclc_num | 28227700 |
| open_access_boolean | |
| owner | DE-91G DE-BY-TUM |
| owner_facet | DE-91G DE-BY-TUM |
| physical | 44 S. |
| publishDate | 1991 |
| publishDateSearch | 1991 |
| publishDateSort | 1991 |
| record_format | marc |
| series2 | Università degli Studi <Pisa> / Dipartimento di Informatica: Technical report |
| spelling | Gabbrielli, Maurizio Verfasser aut Unfolding and fixpoint semantics of concurrent constraint logic programs M. Gabbrielli ; G. Levi Pisa 1991 44 S. txt rdacontent n rdamedia nc rdacarrier Università degli Studi <Pisa> / Dipartimento di Informatica: Technical report 1991,2 Abstract: "We present a new semantics for a language in the family of concurrent constraint logic languages. The semantics can be used on a notion of clause unfolding, since the language is closed under this transformation. The unfolding semantics is obtained as limit of an infinite unfolding process. Unfolding is also used to define an immediate consequences operator, and, therefore, a fixpoint semantics in the typical logic programming style. The result of both the unfolding and the fixpoint semantics is a set of reactive behaviors, which are trees abstractly representing all the possible computations of a program, including deadlocks and finite failures." Logic programming Levi, Giorgio 1942- Verfasser (DE-588)1077828853 aut Dipartimento di Informatica: Technical report Università degli Studi <Pisa> 1991,2 (DE-604)BV010841375 1991,2 |
| spellingShingle | Gabbrielli, Maurizio Levi, Giorgio 1942- Unfolding and fixpoint semantics of concurrent constraint logic programs Logic programming |
| title | Unfolding and fixpoint semantics of concurrent constraint logic programs |
| title_auth | Unfolding and fixpoint semantics of concurrent constraint logic programs |
| title_exact_search | Unfolding and fixpoint semantics of concurrent constraint logic programs |
| title_full | Unfolding and fixpoint semantics of concurrent constraint logic programs M. Gabbrielli ; G. Levi |
| title_fullStr | Unfolding and fixpoint semantics of concurrent constraint logic programs M. Gabbrielli ; G. Levi |
| title_full_unstemmed | Unfolding and fixpoint semantics of concurrent constraint logic programs M. Gabbrielli ; G. Levi |
| title_short | Unfolding and fixpoint semantics of concurrent constraint logic programs |
| title_sort | unfolding and fixpoint semantics of concurrent constraint logic programs |
| topic | Logic programming |
| topic_facet | Logic programming |
| volume_link | (DE-604)BV010841375 |
| work_keys_str_mv | AT gabbriellimaurizio unfoldingandfixpointsemanticsofconcurrentconstraintlogicprograms AT levigiorgio unfoldingandfixpointsemanticsofconcurrentconstraintlogicprograms |