Modeling answer constraints in constraint logic programs:
Abstract: "The constraint logic programming paradigm CLP (X) (CLP for short) has been proposed by Jaffar and Lassez in order to integrate a generic computational mechanism based on constraints with the logic programming framework. This paradigm retains the semantic properties of logic languages...
Gespeichert in:
| Hauptverfasser: | , |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Pisa
1991
|
| Schriftenreihe: | Università degli Studi <Pisa> / Dipartimento di Informatica: Technical report
1991,4 |
| Schlagworte: | |
| Zusammenfassung: | Abstract: "The constraint logic programming paradigm CLP (X) (CLP for short) has been proposed by Jaffar and Lassez in order to integrate a generic computational mechanism based on constraints with the logic programming framework. This paradigm retains the semantic properties of logic languages, namely the existence of equivalent operational, model theoretic and fixpoint semantics. Moreover, since computation is performed over the particular domain of computation X, CLP (X) programs have an equivalent 'algebraic' semantics, i.e. a semantics which is defined directly on the algebraic structure of the domain X. In this paper we propose an extension of such a semantics, for the success set case, in order to fully characterize the operational behaviour of programs We introduce a framework of defining various notions of models, each corresponding to a specific operationally observable property. The construction is based on a new notion of interpretation (set of constrained atoms), on a natural extension of the standard notion of truth and on the definition of various immediate consequences operators T[subscript i], whose least fixpoints on the lattice of interpretations are models corresponding to various observable properties. Since within our framework the equivalence between the operational and the declarative semantics can be fully achieved, it can be taken as the basis of program transformation and analyses techniques In particular, it is possible to define suitable abstract immediate consequence operators and therefore a bottom-up abstract interpretation framework which generalizes to the CLP case an approach developed for pure logic programs. |
| Beschreibung: | 19 S. |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV010843939 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | t | ||
| 008 | 960711s1991 |||| 00||| engod | ||
| 035 | |a (OCoLC)28284984 | ||
| 035 | |a (DE-599)BVBBV010843939 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-91G | ||
| 100 | 1 | |a Gabbrielli, Maurizio |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Modeling answer constraints in constraint logic programs |c M. Gabbrielli ; G. Levi |
| 264 | 1 | |a Pisa |c 1991 | |
| 300 | |a 19 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,4 | |
| 520 | 3 | |a Abstract: "The constraint logic programming paradigm CLP (X) (CLP for short) has been proposed by Jaffar and Lassez in order to integrate a generic computational mechanism based on constraints with the logic programming framework. This paradigm retains the semantic properties of logic languages, namely the existence of equivalent operational, model theoretic and fixpoint semantics. Moreover, since computation is performed over the particular domain of computation X, CLP (X) programs have an equivalent 'algebraic' semantics, i.e. a semantics which is defined directly on the algebraic structure of the domain X. In this paper we propose an extension of such a semantics, for the success set case, in order to fully characterize the operational behaviour of programs | |
| 520 | 3 | |a We introduce a framework of defining various notions of models, each corresponding to a specific operationally observable property. The construction is based on a new notion of interpretation (set of constrained atoms), on a natural extension of the standard notion of truth and on the definition of various immediate consequences operators T[subscript i], whose least fixpoints on the lattice of interpretations are models corresponding to various observable properties. Since within our framework the equivalence between the operational and the declarative semantics can be fully achieved, it can be taken as the basis of program transformation and analyses techniques | |
| 520 | 3 | |a In particular, it is possible to define suitable abstract immediate consequence operators and therefore a bottom-up abstract interpretation framework which generalizes to the CLP case an approach developed for pure logic programs. | |
| 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,4 |w (DE-604)BV010841375 |9 1991,4 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-007249118 | ||
Datensatz im Suchindex
| _version_ | 1804125331818283009 |
|---|---|
| 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 | BV010843939 |
| ctrlnum | (OCoLC)28284984 (DE-599)BVBBV010843939 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>02721nam a2200325 cb4500</leader><controlfield tag="001">BV010843939</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">960711s1991 |||| 00||| engod</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)28284984</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV010843939</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">Gabbrielli, Maurizio</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Modeling answer constraints in 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">19 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,4</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Abstract: "The constraint logic programming paradigm CLP (X) (CLP for short) has been proposed by Jaffar and Lassez in order to integrate a generic computational mechanism based on constraints with the logic programming framework. This paradigm retains the semantic properties of logic languages, namely the existence of equivalent operational, model theoretic and fixpoint semantics. Moreover, since computation is performed over the particular domain of computation X, CLP (X) programs have an equivalent 'algebraic' semantics, i.e. a semantics which is defined directly on the algebraic structure of the domain X. In this paper we propose an extension of such a semantics, for the success set case, in order to fully characterize the operational behaviour of programs</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">We introduce a framework of defining various notions of models, each corresponding to a specific operationally observable property. The construction is based on a new notion of interpretation (set of constrained atoms), on a natural extension of the standard notion of truth and on the definition of various immediate consequences operators T[subscript i], whose least fixpoints on the lattice of interpretations are models corresponding to various observable properties. Since within our framework the equivalence between the operational and the declarative semantics can be fully achieved, it can be taken as the basis of program transformation and analyses techniques</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">In particular, it is possible to define suitable abstract immediate consequence operators and therefore a bottom-up abstract interpretation framework which generalizes to the CLP case an approach developed for pure logic programs.</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,4</subfield><subfield code="w">(DE-604)BV010841375</subfield><subfield code="9">1991,4</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-007249118</subfield></datafield></record></collection> |
| id | DE-604.BV010843939 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-09T17:59:52Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-007249118 |
| oclc_num | 28284984 |
| open_access_boolean | |
| owner | DE-91G DE-BY-TUM |
| owner_facet | DE-91G DE-BY-TUM |
| physical | 19 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 Modeling answer constraints in constraint logic programs M. Gabbrielli ; G. Levi Pisa 1991 19 S. txt rdacontent n rdamedia nc rdacarrier Università degli Studi <Pisa> / Dipartimento di Informatica: Technical report 1991,4 Abstract: "The constraint logic programming paradigm CLP (X) (CLP for short) has been proposed by Jaffar and Lassez in order to integrate a generic computational mechanism based on constraints with the logic programming framework. This paradigm retains the semantic properties of logic languages, namely the existence of equivalent operational, model theoretic and fixpoint semantics. Moreover, since computation is performed over the particular domain of computation X, CLP (X) programs have an equivalent 'algebraic' semantics, i.e. a semantics which is defined directly on the algebraic structure of the domain X. In this paper we propose an extension of such a semantics, for the success set case, in order to fully characterize the operational behaviour of programs We introduce a framework of defining various notions of models, each corresponding to a specific operationally observable property. The construction is based on a new notion of interpretation (set of constrained atoms), on a natural extension of the standard notion of truth and on the definition of various immediate consequences operators T[subscript i], whose least fixpoints on the lattice of interpretations are models corresponding to various observable properties. Since within our framework the equivalence between the operational and the declarative semantics can be fully achieved, it can be taken as the basis of program transformation and analyses techniques In particular, it is possible to define suitable abstract immediate consequence operators and therefore a bottom-up abstract interpretation framework which generalizes to the CLP case an approach developed for pure logic programs. Logic programming Levi, Giorgio 1942- Verfasser (DE-588)1077828853 aut Dipartimento di Informatica: Technical report Università degli Studi <Pisa> 1991,4 (DE-604)BV010841375 1991,4 |
| spellingShingle | Gabbrielli, Maurizio Levi, Giorgio 1942- Modeling answer constraints in constraint logic programs Logic programming |
| title | Modeling answer constraints in constraint logic programs |
| title_auth | Modeling answer constraints in constraint logic programs |
| title_exact_search | Modeling answer constraints in constraint logic programs |
| title_full | Modeling answer constraints in constraint logic programs M. Gabbrielli ; G. Levi |
| title_fullStr | Modeling answer constraints in constraint logic programs M. Gabbrielli ; G. Levi |
| title_full_unstemmed | Modeling answer constraints in constraint logic programs M. Gabbrielli ; G. Levi |
| title_short | Modeling answer constraints in constraint logic programs |
| title_sort | modeling answer constraints in constraint logic programs |
| topic | Logic programming |
| topic_facet | Logic programming |
| volume_link | (DE-604)BV010841375 |
| work_keys_str_mv | AT gabbriellimaurizio modelinganswerconstraintsinconstraintlogicprograms AT levigiorgio modelinganswerconstraintsinconstraintlogicprograms |