Transformation based bottom up computation of the well-founded model:
Abstract: "We present a bottom-up algorithm for the computation of the well-founded model of non-disjunctive logic programs. Our method is based on the elementary program transformations studied by Brass and Dix [BD95b, BD95c]. However, their 'residual program' can grow to exponential...
Gespeichert in:
| Hauptverfasser: | , , |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Passau
1996
|
| Schriftenreihe: | Universität <Passau> / Fakultät für Mathematik und Informatik: MIP
1996,20 |
| Schlagworte: | |
| Zusammenfassung: | Abstract: "We present a bottom-up algorithm for the computation of the well-founded model of non-disjunctive logic programs. Our method is based on the elementary program transformations studied by Brass and Dix [BD95b, BD95c]. However, their 'residual program' can grow to exponential size, whereas for function-free programs our 'program remainder' is always polynomial in the size, i.e. the number of tuples, of the extensional database (EDB). As in the SLG-resolution of Chen and Warren [CS93, CSW95, CW96], we do not only delay negative but also positive literals if they depend on delayed negative literals. When disregarding goal-directedness, which needs additional concepts, our approach can be seen as a simplified bottom-up version of SLG-resolution applicable to range-restricted Datalog programs. Since our approach is also closely related to the alternating fixpoint procedure [VG89, VG93], it can possibly serve as a basis for an integration of the resolution-based, fixpoint-based, and transformation- based evaluation methods." |
| Beschreibung: | 48, 5 S. |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV011190042 | ||
| 003 | DE-604 | ||
| 005 | 19970530 | ||
| 007 | t | ||
| 008 | 970206s1996 |||| 00||| eng d | ||
| 035 | |a (OCoLC)38179127 | ||
| 035 | |a (DE-599)BVBBV011190042 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-154 |a DE-739 |a DE-384 |a DE-12 |a DE-634 | ||
| 084 | |a SS 5600 |0 (DE-625)143571: |2 rvk | ||
| 100 | 1 | |a Zukowski, Ulrich |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Transformation based bottom up computation of the well-founded model |c Ulrich Zukowski and Burkhard Freitag ; Stefan Brass |
| 246 | 1 | 3 | |a Transformation-based bottom-up computation of the well-founded model |
| 264 | 1 | |a Passau |c 1996 | |
| 300 | |a 48, 5 S. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a Universität <Passau> / Fakultät für Mathematik und Informatik: MIP |v 1996,20 | |
| 520 | 3 | |a Abstract: "We present a bottom-up algorithm for the computation of the well-founded model of non-disjunctive logic programs. Our method is based on the elementary program transformations studied by Brass and Dix [BD95b, BD95c]. However, their 'residual program' can grow to exponential size, whereas for function-free programs our 'program remainder' is always polynomial in the size, i.e. the number of tuples, of the extensional database (EDB). As in the SLG-resolution of Chen and Warren [CS93, CSW95, CW96], we do not only delay negative but also positive literals if they depend on delayed negative literals. When disregarding goal-directedness, which needs additional concepts, our approach can be seen as a simplified bottom-up version of SLG-resolution applicable to range-restricted Datalog programs. Since our approach is also closely related to the alternating fixpoint procedure [VG89, VG93], it can possibly serve as a basis for an integration of the resolution-based, fixpoint-based, and transformation- based evaluation methods." | |
| 650 | 4 | |a Databases | |
| 650 | 4 | |a Logic programming | |
| 650 | 0 | 7 | |a Informatik |0 (DE-588)4026894-9 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Theoretische Informatik |0 (DE-588)4196735-5 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Mathematik |0 (DE-588)4037944-9 |2 gnd |9 rswk-swf |
| 689 | 0 | 0 | |a Theoretische Informatik |0 (DE-588)4196735-5 |D s |
| 689 | 0 | 1 | |a Informatik |0 (DE-588)4026894-9 |D s |
| 689 | 0 | 2 | |a Mathematik |0 (DE-588)4037944-9 |D s |
| 689 | 0 | |5 DE-604 | |
| 700 | 1 | |a Freitag, Burkhard |d 1953- |e Verfasser |0 (DE-588)120549158 |4 aut | |
| 700 | 1 | |a Brass, Stefan |e Verfasser |4 aut | |
| 810 | 2 | |a Fakultät für Mathematik und Informatik: MIP |t Universität <Passau> |v 1996,20 |w (DE-604)BV000905393 |9 1996,20 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-007504636 | ||
Datensatz im Suchindex
| _version_ | 1804125686139453440 |
|---|---|
| any_adam_object | |
| author | Zukowski, Ulrich Freitag, Burkhard 1953- Brass, Stefan |
| author_GND | (DE-588)120549158 |
| author_facet | Zukowski, Ulrich Freitag, Burkhard 1953- Brass, Stefan |
| author_role | aut aut aut |
| author_sort | Zukowski, Ulrich |
| author_variant | u z uz b f bf s b sb |
| building | Verbundindex |
| bvnumber | BV011190042 |
| classification_rvk | SS 5600 |
| ctrlnum | (OCoLC)38179127 (DE-599)BVBBV011190042 |
| discipline | Informatik |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>02703nam a2200433 cb4500</leader><controlfield tag="001">BV011190042</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">19970530 </controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">970206s1996 |||| 00||| eng d</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)38179127</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV011190042</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-154</subfield><subfield code="a">DE-739</subfield><subfield code="a">DE-384</subfield><subfield code="a">DE-12</subfield><subfield code="a">DE-634</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">SS 5600</subfield><subfield code="0">(DE-625)143571:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Zukowski, Ulrich</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Transformation based bottom up computation of the well-founded model</subfield><subfield code="c">Ulrich Zukowski and Burkhard Freitag ; Stefan Brass</subfield></datafield><datafield tag="246" ind1="1" ind2="3"><subfield code="a">Transformation-based bottom-up computation of the well-founded model</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Passau</subfield><subfield code="c">1996</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">48, 5 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ät <Passau> / Fakultät für Mathematik und Informatik: MIP</subfield><subfield code="v">1996,20</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Abstract: "We present a bottom-up algorithm for the computation of the well-founded model of non-disjunctive logic programs. Our method is based on the elementary program transformations studied by Brass and Dix [BD95b, BD95c]. However, their 'residual program' can grow to exponential size, whereas for function-free programs our 'program remainder' is always polynomial in the size, i.e. the number of tuples, of the extensional database (EDB). As in the SLG-resolution of Chen and Warren [CS93, CSW95, CW96], we do not only delay negative but also positive literals if they depend on delayed negative literals. When disregarding goal-directedness, which needs additional concepts, our approach can be seen as a simplified bottom-up version of SLG-resolution applicable to range-restricted Datalog programs. Since our approach is also closely related to the alternating fixpoint procedure [VG89, VG93], it can possibly serve as a basis for an integration of the resolution-based, fixpoint-based, and transformation- based evaluation methods."</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Databases</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Logic programming</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Informatik</subfield><subfield code="0">(DE-588)4026894-9</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Theoretische Informatik</subfield><subfield code="0">(DE-588)4196735-5</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Mathematik</subfield><subfield code="0">(DE-588)4037944-9</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Theoretische Informatik</subfield><subfield code="0">(DE-588)4196735-5</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="1"><subfield code="a">Informatik</subfield><subfield code="0">(DE-588)4026894-9</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="2"><subfield code="a">Mathematik</subfield><subfield code="0">(DE-588)4037944-9</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Freitag, Burkhard</subfield><subfield code="d">1953-</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)120549158</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Brass, Stefan</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="810" ind1="2" ind2=" "><subfield code="a">Fakultät für Mathematik und Informatik: MIP</subfield><subfield code="t">Universität <Passau></subfield><subfield code="v">1996,20</subfield><subfield code="w">(DE-604)BV000905393</subfield><subfield code="9">1996,20</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-007504636</subfield></datafield></record></collection> |
| id | DE-604.BV011190042 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-09T18:05:30Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-007504636 |
| oclc_num | 38179127 |
| open_access_boolean | |
| owner | DE-154 DE-739 DE-384 DE-12 DE-634 |
| owner_facet | DE-154 DE-739 DE-384 DE-12 DE-634 |
| physical | 48, 5 S. |
| publishDate | 1996 |
| publishDateSearch | 1996 |
| publishDateSort | 1996 |
| record_format | marc |
| series2 | Universität <Passau> / Fakultät für Mathematik und Informatik: MIP |
| spelling | Zukowski, Ulrich Verfasser aut Transformation based bottom up computation of the well-founded model Ulrich Zukowski and Burkhard Freitag ; Stefan Brass Transformation-based bottom-up computation of the well-founded model Passau 1996 48, 5 S. txt rdacontent n rdamedia nc rdacarrier Universität <Passau> / Fakultät für Mathematik und Informatik: MIP 1996,20 Abstract: "We present a bottom-up algorithm for the computation of the well-founded model of non-disjunctive logic programs. Our method is based on the elementary program transformations studied by Brass and Dix [BD95b, BD95c]. However, their 'residual program' can grow to exponential size, whereas for function-free programs our 'program remainder' is always polynomial in the size, i.e. the number of tuples, of the extensional database (EDB). As in the SLG-resolution of Chen and Warren [CS93, CSW95, CW96], we do not only delay negative but also positive literals if they depend on delayed negative literals. When disregarding goal-directedness, which needs additional concepts, our approach can be seen as a simplified bottom-up version of SLG-resolution applicable to range-restricted Datalog programs. Since our approach is also closely related to the alternating fixpoint procedure [VG89, VG93], it can possibly serve as a basis for an integration of the resolution-based, fixpoint-based, and transformation- based evaluation methods." Databases Logic programming Informatik (DE-588)4026894-9 gnd rswk-swf Theoretische Informatik (DE-588)4196735-5 gnd rswk-swf Mathematik (DE-588)4037944-9 gnd rswk-swf Theoretische Informatik (DE-588)4196735-5 s Informatik (DE-588)4026894-9 s Mathematik (DE-588)4037944-9 s DE-604 Freitag, Burkhard 1953- Verfasser (DE-588)120549158 aut Brass, Stefan Verfasser aut Fakultät für Mathematik und Informatik: MIP Universität <Passau> 1996,20 (DE-604)BV000905393 1996,20 |
| spellingShingle | Zukowski, Ulrich Freitag, Burkhard 1953- Brass, Stefan Transformation based bottom up computation of the well-founded model Databases Logic programming Informatik (DE-588)4026894-9 gnd Theoretische Informatik (DE-588)4196735-5 gnd Mathematik (DE-588)4037944-9 gnd |
| subject_GND | (DE-588)4026894-9 (DE-588)4196735-5 (DE-588)4037944-9 |
| title | Transformation based bottom up computation of the well-founded model |
| title_alt | Transformation-based bottom-up computation of the well-founded model |
| title_auth | Transformation based bottom up computation of the well-founded model |
| title_exact_search | Transformation based bottom up computation of the well-founded model |
| title_full | Transformation based bottom up computation of the well-founded model Ulrich Zukowski and Burkhard Freitag ; Stefan Brass |
| title_fullStr | Transformation based bottom up computation of the well-founded model Ulrich Zukowski and Burkhard Freitag ; Stefan Brass |
| title_full_unstemmed | Transformation based bottom up computation of the well-founded model Ulrich Zukowski and Burkhard Freitag ; Stefan Brass |
| title_short | Transformation based bottom up computation of the well-founded model |
| title_sort | transformation based bottom up computation of the well founded model |
| topic | Databases Logic programming Informatik (DE-588)4026894-9 gnd Theoretische Informatik (DE-588)4196735-5 gnd Mathematik (DE-588)4037944-9 gnd |
| topic_facet | Databases Logic programming Informatik Theoretische Informatik Mathematik |
| volume_link | (DE-604)BV000905393 |
| work_keys_str_mv | AT zukowskiulrich transformationbasedbottomupcomputationofthewellfoundedmodel AT freitagburkhard transformationbasedbottomupcomputationofthewellfoundedmodel AT brassstefan transformationbasedbottomupcomputationofthewellfoundedmodel |