Non-determinism in deductive databases:
Abstract: "This paper examines the problem of adding non- deterministic constructs to a declarative database language based on Horn Clause Logic. We revise a previously proposed approach, the choice construct introduced by Krishnamurthy and Naqvi, from the viewpoints of amenability to efficient...
Saved in:
| Format: | Book |
|---|---|
| Language: | English |
| Published: |
Pisa
1991
|
| Series: | Università degli Studi <Pisa> / Dipartimento di Informatica: Technical report
1991,21 |
| Subjects: | |
| Summary: | Abstract: "This paper examines the problem of adding non- deterministic constructs to a declarative database language based on Horn Clause Logic. We revise a previously proposed approach, the choice construct introduced by Krishnamurthy and Naqvi, from the viewpoints of amenability to efficient implementation and expressive power. Thus, we define a construct called dynamic choice, which is consistent with the fixpoint-based semantics, fixes some deficiencies of the former approach, and leads to efficient implementations in the framework of deductive databases. Also the new construct extends the expressive power of Datalog programs considerably, as it allows to express negation under Closed World Assumption, as well as a class of relevant deterministic problems." |
| Physical Description: | 25 S. |
Staff View
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV010848121 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | t | ||
| 008 | 960712s1991 |||| 00||| engod | ||
| 035 | |a (OCoLC)28284993 | ||
| 035 | |a (DE-599)BVBBV010848121 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-91G | ||
| 245 | 1 | 0 | |a Non-determinism in deductive databases |c F. Giannotti ... |
| 264 | 1 | |a Pisa |c 1991 | |
| 300 | |a 25 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,21 | |
| 520 | 3 | |a Abstract: "This paper examines the problem of adding non- deterministic constructs to a declarative database language based on Horn Clause Logic. We revise a previously proposed approach, the choice construct introduced by Krishnamurthy and Naqvi, from the viewpoints of amenability to efficient implementation and expressive power. Thus, we define a construct called dynamic choice, which is consistent with the fixpoint-based semantics, fixes some deficiencies of the former approach, and leads to efficient implementations in the framework of deductive databases. Also the new construct extends the expressive power of Datalog programs considerably, as it allows to express negation under Closed World Assumption, as well as a class of relevant deterministic problems." | |
| 650 | 4 | |a Deductive databases | |
| 650 | 4 | |a Logic programming | |
| 700 | 1 | |a Giannotti, Fosca |e Sonstige |4 oth | |
| 810 | 2 | |a Dipartimento di Informatica: Technical report |t Università degli Studi <Pisa> |v 1991,21 |w (DE-604)BV010841375 |9 1991,21 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-007250766 | ||
Record in the Search Index
| _version_ | 1804125334040215552 |
|---|---|
| any_adam_object | |
| building | Verbundindex |
| bvnumber | BV010848121 |
| ctrlnum | (OCoLC)28284993 (DE-599)BVBBV010848121 |
| 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">BV010848121</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">960712s1991 |||| 00||| engod</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)28284993</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV010848121</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="245" ind1="1" ind2="0"><subfield code="a">Non-determinism in deductive databases</subfield><subfield code="c">F. Giannotti ...</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">25 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,21</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Abstract: "This paper examines the problem of adding non- deterministic constructs to a declarative database language based on Horn Clause Logic. We revise a previously proposed approach, the choice construct introduced by Krishnamurthy and Naqvi, from the viewpoints of amenability to efficient implementation and expressive power. Thus, we define a construct called dynamic choice, which is consistent with the fixpoint-based semantics, fixes some deficiencies of the former approach, and leads to efficient implementations in the framework of deductive databases. Also the new construct extends the expressive power of Datalog programs considerably, as it allows to express negation under Closed World Assumption, as well as a class of relevant deterministic problems."</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Deductive databases</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Logic programming</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Giannotti, Fosca</subfield><subfield code="e">Sonstige</subfield><subfield code="4">oth</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,21</subfield><subfield code="w">(DE-604)BV010841375</subfield><subfield code="9">1991,21</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-007250766</subfield></datafield></record></collection> |
| id | DE-604.BV010848121 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-09T17:59:54Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-007250766 |
| oclc_num | 28284993 |
| open_access_boolean | |
| owner | DE-91G DE-BY-TUM |
| owner_facet | DE-91G DE-BY-TUM |
| physical | 25 S. |
| publishDate | 1991 |
| publishDateSearch | 1991 |
| publishDateSort | 1991 |
| record_format | marc |
| series2 | Università degli Studi <Pisa> / Dipartimento di Informatica: Technical report |
| spelling | Non-determinism in deductive databases F. Giannotti ... Pisa 1991 25 S. txt rdacontent n rdamedia nc rdacarrier Università degli Studi <Pisa> / Dipartimento di Informatica: Technical report 1991,21 Abstract: "This paper examines the problem of adding non- deterministic constructs to a declarative database language based on Horn Clause Logic. We revise a previously proposed approach, the choice construct introduced by Krishnamurthy and Naqvi, from the viewpoints of amenability to efficient implementation and expressive power. Thus, we define a construct called dynamic choice, which is consistent with the fixpoint-based semantics, fixes some deficiencies of the former approach, and leads to efficient implementations in the framework of deductive databases. Also the new construct extends the expressive power of Datalog programs considerably, as it allows to express negation under Closed World Assumption, as well as a class of relevant deterministic problems." Deductive databases Logic programming Giannotti, Fosca Sonstige oth Dipartimento di Informatica: Technical report Università degli Studi <Pisa> 1991,21 (DE-604)BV010841375 1991,21 |
| spellingShingle | Non-determinism in deductive databases Deductive databases Logic programming |
| title | Non-determinism in deductive databases |
| title_auth | Non-determinism in deductive databases |
| title_exact_search | Non-determinism in deductive databases |
| title_full | Non-determinism in deductive databases F. Giannotti ... |
| title_fullStr | Non-determinism in deductive databases F. Giannotti ... |
| title_full_unstemmed | Non-determinism in deductive databases F. Giannotti ... |
| title_short | Non-determinism in deductive databases |
| title_sort | non determinism in deductive databases |
| topic | Deductive databases Logic programming |
| topic_facet | Deductive databases Logic programming |
| volume_link | (DE-604)BV010841375 |
| work_keys_str_mv | AT giannottifosca nondeterminismindeductivedatabases |