Comparative semantics for flow of control in logic programming without logic:
Abstract: "We study semantic issues concerning control flow notions in logic programming languages by exploring a two-stage approach. The first stage considers solely uninterpreted (or schematic) elementary actions, rather than operations such as unification, substitution generation or refutati...
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Amsterdam
1988
|
| Schriftenreihe: | Centrum voor Wiskunde en Informatica <Amsterdam> / Department of Computer Science: Report CS
88,40 |
| Schlagworte: | |
| Zusammenfassung: | Abstract: "We study semantic issues concerning control flow notions in logic programming languages by exploring a two-stage approach. The first stage considers solely uninterpreted (or schematic) elementary actions, rather than operations such as unification, substitution generation or refutation. Accordingly, logic is absent at this first stage. We provide a comparative survey of the semantics of a variety of control flow notions in (uninterpreted) logic programming languages including notions such as don't know versus don't care nondeterminism, the cut operator, and/or parallel logic programming, and the commit operator. In all cases considered, we develop operational and denotational models, and prove their equivalence A central tool both in the definitions and in the equivalence proofs is Banach's theorem on (the uniqueness of) fixed points of contracting functions on complete metric spaces. The second stage of the approach proceeds by interpreting the elementary actions, first as arbitrary state transformations, and next by suitably instantiating the sets of states and of state transformations (and by articulating the way in which a logic program determines a set of recursive procedure declarations). The paper concentrates on the first stage. For the second stage, only a few hints are included. Furthermore, references to papers which supply details for the languages PROLOG, CONCURRENT PROLOG and GUARDED HORN CLAUSES are provided. |
| Beschreibung: | 38 S. |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV009245978 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | t | ||
| 008 | 940313s1988 |||| 00||| eng d | ||
| 035 | |a (OCoLC)20988453 | ||
| 035 | |a (DE-599)BVBBV009245978 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-29T | ||
| 100 | 1 | |a Bakker, Jacobus W. de |d 1939-2012 |e Verfasser |0 (DE-588)1047965461 |4 aut | |
| 245 | 1 | 0 | |a Comparative semantics for flow of control in logic programming without logic |c J. W. de Bakker |
| 264 | 1 | |a Amsterdam |c 1988 | |
| 300 | |a 38 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 88,40 | |
| 520 | 3 | |a Abstract: "We study semantic issues concerning control flow notions in logic programming languages by exploring a two-stage approach. The first stage considers solely uninterpreted (or schematic) elementary actions, rather than operations such as unification, substitution generation or refutation. Accordingly, logic is absent at this first stage. We provide a comparative survey of the semantics of a variety of control flow notions in (uninterpreted) logic programming languages including notions such as don't know versus don't care nondeterminism, the cut operator, and/or parallel logic programming, and the commit operator. In all cases considered, we develop operational and denotational models, and prove their equivalence | |
| 520 | 3 | |a A central tool both in the definitions and in the equivalence proofs is Banach's theorem on (the uniqueness of) fixed points of contracting functions on complete metric spaces. The second stage of the approach proceeds by interpreting the elementary actions, first as arbitrary state transformations, and next by suitably instantiating the sets of states and of state transformations (and by articulating the way in which a logic program determines a set of recursive procedure declarations). The paper concentrates on the first stage. For the second stage, only a few hints are included. Furthermore, references to papers which supply details for the languages PROLOG, CONCURRENT PROLOG and GUARDED HORN CLAUSES are provided. | |
| 650 | 4 | |a Logic programming | |
| 650 | 4 | |a Semantics | |
| 810 | 2 | |a Department of Computer Science: Report CS |t Centrum voor Wiskunde en Informatica <Amsterdam> |v 88,40 |w (DE-604)BV008928356 |9 88,40 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-006152317 | ||
Datensatz im Suchindex
| _version_ | 1804123693257850880 |
|---|---|
| any_adam_object | |
| author | Bakker, Jacobus W. de 1939-2012 |
| author_GND | (DE-588)1047965461 |
| author_facet | Bakker, Jacobus W. de 1939-2012 |
| author_role | aut |
| author_sort | Bakker, Jacobus W. de 1939-2012 |
| author_variant | j w d b jwd jwdb |
| building | Verbundindex |
| bvnumber | BV009245978 |
| ctrlnum | (OCoLC)20988453 (DE-599)BVBBV009245978 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>02518nam a2200313 cb4500</leader><controlfield tag="001">BV009245978</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">940313s1988 |||| 00||| eng d</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)20988453</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV009245978</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">Bakker, Jacobus W. de</subfield><subfield code="d">1939-2012</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)1047965461</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Comparative semantics for flow of control in logic programming without logic</subfield><subfield code="c">J. W. de Bakker</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Amsterdam</subfield><subfield code="c">1988</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">38 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">88,40</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Abstract: "We study semantic issues concerning control flow notions in logic programming languages by exploring a two-stage approach. The first stage considers solely uninterpreted (or schematic) elementary actions, rather than operations such as unification, substitution generation or refutation. Accordingly, logic is absent at this first stage. We provide a comparative survey of the semantics of a variety of control flow notions in (uninterpreted) logic programming languages including notions such as don't know versus don't care nondeterminism, the cut operator, and/or parallel logic programming, and the commit operator. In all cases considered, we develop operational and denotational models, and prove their equivalence</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">A central tool both in the definitions and in the equivalence proofs is Banach's theorem on (the uniqueness of) fixed points of contracting functions on complete metric spaces. The second stage of the approach proceeds by interpreting the elementary actions, first as arbitrary state transformations, and next by suitably instantiating the sets of states and of state transformations (and by articulating the way in which a logic program determines a set of recursive procedure declarations). The paper concentrates on the first stage. For the second stage, only a few hints are included. Furthermore, references to papers which supply details for the languages PROLOG, CONCURRENT PROLOG and GUARDED HORN CLAUSES are provided.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Logic programming</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Semantics</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">88,40</subfield><subfield code="w">(DE-604)BV008928356</subfield><subfield code="9">88,40</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-006152317</subfield></datafield></record></collection> |
| id | DE-604.BV009245978 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-09T17:33:49Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-006152317 |
| oclc_num | 20988453 |
| open_access_boolean | |
| owner | DE-29T |
| owner_facet | DE-29T |
| physical | 38 S. |
| publishDate | 1988 |
| publishDateSearch | 1988 |
| publishDateSort | 1988 |
| record_format | marc |
| series2 | Centrum voor Wiskunde en Informatica <Amsterdam> / Department of Computer Science: Report CS |
| spelling | Bakker, Jacobus W. de 1939-2012 Verfasser (DE-588)1047965461 aut Comparative semantics for flow of control in logic programming without logic J. W. de Bakker Amsterdam 1988 38 S. txt rdacontent n rdamedia nc rdacarrier Centrum voor Wiskunde en Informatica <Amsterdam> / Department of Computer Science: Report CS 88,40 Abstract: "We study semantic issues concerning control flow notions in logic programming languages by exploring a two-stage approach. The first stage considers solely uninterpreted (or schematic) elementary actions, rather than operations such as unification, substitution generation or refutation. Accordingly, logic is absent at this first stage. We provide a comparative survey of the semantics of a variety of control flow notions in (uninterpreted) logic programming languages including notions such as don't know versus don't care nondeterminism, the cut operator, and/or parallel logic programming, and the commit operator. In all cases considered, we develop operational and denotational models, and prove their equivalence A central tool both in the definitions and in the equivalence proofs is Banach's theorem on (the uniqueness of) fixed points of contracting functions on complete metric spaces. The second stage of the approach proceeds by interpreting the elementary actions, first as arbitrary state transformations, and next by suitably instantiating the sets of states and of state transformations (and by articulating the way in which a logic program determines a set of recursive procedure declarations). The paper concentrates on the first stage. For the second stage, only a few hints are included. Furthermore, references to papers which supply details for the languages PROLOG, CONCURRENT PROLOG and GUARDED HORN CLAUSES are provided. Logic programming Semantics Department of Computer Science: Report CS Centrum voor Wiskunde en Informatica <Amsterdam> 88,40 (DE-604)BV008928356 88,40 |
| spellingShingle | Bakker, Jacobus W. de 1939-2012 Comparative semantics for flow of control in logic programming without logic Logic programming Semantics |
| title | Comparative semantics for flow of control in logic programming without logic |
| title_auth | Comparative semantics for flow of control in logic programming without logic |
| title_exact_search | Comparative semantics for flow of control in logic programming without logic |
| title_full | Comparative semantics for flow of control in logic programming without logic J. W. de Bakker |
| title_fullStr | Comparative semantics for flow of control in logic programming without logic J. W. de Bakker |
| title_full_unstemmed | Comparative semantics for flow of control in logic programming without logic J. W. de Bakker |
| title_short | Comparative semantics for flow of control in logic programming without logic |
| title_sort | comparative semantics for flow of control in logic programming without logic |
| topic | Logic programming Semantics |
| topic_facet | Logic programming Semantics |
| volume_link | (DE-604)BV008928356 |
| work_keys_str_mv | AT bakkerjacobuswde comparativesemanticsforflowofcontrolinlogicprogrammingwithoutlogic |