A predicate transformer for unification:
Abstract: "In this paper we study unification as predicate transformer. Given a unification problem expressed as a set of sets of terms U and a predicate P, we are interested in the strongest predicate R (w.r.t. the implication) s.t. if P holds before the unification of U then R holds when the...
Gespeichert in:
| Hauptverfasser: | , |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Amsterdam
1992
|
| Schriftenreihe: | Centrum voor Wiskunde en Informatica <Amsterdam> / Department of Computer Science: Report CS
92,27 |
| Schlagworte: | |
| Zusammenfassung: | Abstract: "In this paper we study unification as predicate transformer. Given a unification problem expressed as a set of sets of terms U and a predicate P, we are interested in the strongest predicate R (w.r.t. the implication) s.t. if P holds before the unification of U then R holds when the unification is performed. We introduce a Dijkstra-style calculus that given P and U computes R. We prove the soundness, completeness and termination of the calculus. The predicate language considered contains monotonic predicates together with some non-monotonic predicates like var, [not]ground, share and [not]share. This allows to [sic] use the calculus for the static analysis of run-time properties of Prolog programs." |
| Beschreibung: | 16 S. |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV009008749 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | t | ||
| 008 | 940206s1992 |||| 00||| eng d | ||
| 035 | |a (OCoLC)27670703 | ||
| 035 | |a (DE-599)BVBBV009008749 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-29T | ||
| 100 | 1 | |a Colussi, Livio |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a A predicate transformer for unification |c L. Colussi ; E. Marchiori |
| 264 | 1 | |a Amsterdam |c 1992 | |
| 300 | |a 16 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 92,27 | |
| 520 | 3 | |a Abstract: "In this paper we study unification as predicate transformer. Given a unification problem expressed as a set of sets of terms U and a predicate P, we are interested in the strongest predicate R (w.r.t. the implication) s.t. if P holds before the unification of U then R holds when the unification is performed. We introduce a Dijkstra-style calculus that given P and U computes R. We prove the soundness, completeness and termination of the calculus. The predicate language considered contains monotonic predicates together with some non-monotonic predicates like var, [not]ground, share and [not]share. This allows to [sic] use the calculus for the static analysis of run-time properties of Prolog programs." | |
| 650 | 4 | |a Logic programming | |
| 700 | 1 | |a Marchiori, Elena |e Verfasser |4 aut | |
| 810 | 2 | |a Department of Computer Science: Report CS |t Centrum voor Wiskunde en Informatica <Amsterdam> |v 92,27 |w (DE-604)BV008928356 |9 92,27 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-005955236 | ||
Datensatz im Suchindex
| _version_ | 1804123355890057216 |
|---|---|
| any_adam_object | |
| author | Colussi, Livio Marchiori, Elena |
| author_facet | Colussi, Livio Marchiori, Elena |
| author_role | aut aut |
| author_sort | Colussi, Livio |
| author_variant | l c lc e m em |
| building | Verbundindex |
| bvnumber | BV009008749 |
| ctrlnum | (OCoLC)27670703 (DE-599)BVBBV009008749 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01725nam a2200301 cb4500</leader><controlfield tag="001">BV009008749</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">940206s1992 |||| 00||| eng d</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)27670703</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV009008749</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-29T</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Colussi, Livio</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">A predicate transformer for unification</subfield><subfield code="c">L. Colussi ; E. Marchiori</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Amsterdam</subfield><subfield code="c">1992</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">16 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">92,27</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Abstract: "In this paper we study unification as predicate transformer. Given a unification problem expressed as a set of sets of terms U and a predicate P, we are interested in the strongest predicate R (w.r.t. the implication) s.t. if P holds before the unification of U then R holds when the unification is performed. We introduce a Dijkstra-style calculus that given P and U computes R. We prove the soundness, completeness and termination of the calculus. The predicate language considered contains monotonic predicates together with some non-monotonic predicates like var, [not]ground, share and [not]share. This allows to [sic] use the calculus for the static analysis of run-time properties of Prolog 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">Marchiori, Elena</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">92,27</subfield><subfield code="w">(DE-604)BV008928356</subfield><subfield code="9">92,27</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-005955236</subfield></datafield></record></collection> |
| id | DE-604.BV009008749 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-09T17:28:28Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-005955236 |
| oclc_num | 27670703 |
| open_access_boolean | |
| owner | DE-29T |
| owner_facet | DE-29T |
| physical | 16 S. |
| publishDate | 1992 |
| publishDateSearch | 1992 |
| publishDateSort | 1992 |
| record_format | marc |
| series2 | Centrum voor Wiskunde en Informatica <Amsterdam> / Department of Computer Science: Report CS |
| spelling | Colussi, Livio Verfasser aut A predicate transformer for unification L. Colussi ; E. Marchiori Amsterdam 1992 16 S. txt rdacontent n rdamedia nc rdacarrier Centrum voor Wiskunde en Informatica <Amsterdam> / Department of Computer Science: Report CS 92,27 Abstract: "In this paper we study unification as predicate transformer. Given a unification problem expressed as a set of sets of terms U and a predicate P, we are interested in the strongest predicate R (w.r.t. the implication) s.t. if P holds before the unification of U then R holds when the unification is performed. We introduce a Dijkstra-style calculus that given P and U computes R. We prove the soundness, completeness and termination of the calculus. The predicate language considered contains monotonic predicates together with some non-monotonic predicates like var, [not]ground, share and [not]share. This allows to [sic] use the calculus for the static analysis of run-time properties of Prolog programs." Logic programming Marchiori, Elena Verfasser aut Department of Computer Science: Report CS Centrum voor Wiskunde en Informatica <Amsterdam> 92,27 (DE-604)BV008928356 92,27 |
| spellingShingle | Colussi, Livio Marchiori, Elena A predicate transformer for unification Logic programming |
| title | A predicate transformer for unification |
| title_auth | A predicate transformer for unification |
| title_exact_search | A predicate transformer for unification |
| title_full | A predicate transformer for unification L. Colussi ; E. Marchiori |
| title_fullStr | A predicate transformer for unification L. Colussi ; E. Marchiori |
| title_full_unstemmed | A predicate transformer for unification L. Colussi ; E. Marchiori |
| title_short | A predicate transformer for unification |
| title_sort | a predicate transformer for unification |
| topic | Logic programming |
| topic_facet | Logic programming |
| volume_link | (DE-604)BV008928356 |
| work_keys_str_mv | AT colussilivio apredicatetransformerforunification AT marchiorielena apredicatetransformerforunification |