View in EDS PDF Full Text

A New Partial Semantics for Disjunctive Deductive Databases.

Saved in:
Bibliographic Details
Title: A New Partial Semantics for Disjunctive Deductive Databases.
Authors: Gire, Françoise1 gire@univ-paris1.fr, Plourde, Corinne2 plourde@paragraph.fr
Source: Fundamenta Informaticae. 2005, Vol. 67 Issue 4, p323-342. 20p.
Subjects: Deductive databases, Databases, Computer files, Electronic information resources, Programming language semantics
Abstract: We propose a new partial semantics for disjunctive deductive databases that we call disjunctive well-founded semantics. This semantics extends the classical well-founded semantics of normal databases for disjunctive databases. We give a declarative definition as well as a computational procedure for this new semantics. We prove that, in the case of disjunctive positive databases, i.e. disjunctive databases without negation, the disjunctive well-founded semantics coincides with the intersection of the minimal models. [ABSTRACT FROM AUTHOR]
Copyright of Fundamenta Informaticae is the property of Polskie Towarzystwo Matematyczne and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)
Database: Engineering Source
FullText Links:
  – Type: pdflink
Text:
  Availability: 0
Header DbId: egs
DbLabel: Engineering Source
An: 18316589
AccessLevel: 6
PubType: Academic Journal
PubTypeId: academicJournal
PreciseRelevancyScore: 0
IllustrationInfo
Items – Name: Title
  Label: Title
  Group: Ti
  Data: A New Partial Semantics for Disjunctive Deductive Databases.
– Name: Author
  Label: Authors
  Group: Au
  Data: <searchLink fieldCode="AR" term="%22Gire%2C+Françoise%22">Gire, Françoise</searchLink><relatesTo>1</relatesTo><i> gire@univ-paris1.fr</i><br /><searchLink fieldCode="AR" term="%22Plourde%2C+Corinne%22">Plourde, Corinne</searchLink><relatesTo>2</relatesTo><i> plourde@paragraph.fr</i>
– Name: TitleSource
  Label: Source
  Group: Src
  Data: <searchLink fieldCode="JN" term="%22Fundamenta+Informaticae%22">Fundamenta Informaticae</searchLink>. 2005, Vol. 67 Issue 4, p323-342. 20p.
– Name: Subject
  Label: Subjects
  Group: Su
  Data: <searchLink fieldCode="DE" term="%22Deductive+databases%22">Deductive databases</searchLink><br /><searchLink fieldCode="DE" term="%22Databases%22">Databases</searchLink><br /><searchLink fieldCode="DE" term="%22Computer+files%22">Computer files</searchLink><br /><searchLink fieldCode="DE" term="%22Electronic+information+resources%22">Electronic information resources</searchLink><br /><searchLink fieldCode="DE" term="%22Programming+language+semantics%22">Programming language semantics</searchLink>
– Name: Abstract
  Label: Abstract
  Group: Ab
  Data: We propose a new partial semantics for disjunctive deductive databases that we call disjunctive well-founded semantics. This semantics extends the classical well-founded semantics of normal databases for disjunctive databases. We give a declarative definition as well as a computational procedure for this new semantics. We prove that, in the case of disjunctive positive databases, i.e. disjunctive databases without negation, the disjunctive well-founded semantics coincides with the intersection of the minimal models. [ABSTRACT FROM AUTHOR]
– Name: AbstractSuppliedCopyright
  Label:
  Group: Ab
  Data: <i>Copyright of Fundamenta Informaticae is the property of Polskie Towarzystwo Matematyczne and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract.</i> (Copyright applies to all Abstracts.)
PLink https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&db=egs&AN=18316589
RecordInfo BibRecord:
  BibEntity:
    Identifiers:
      – Type: doi
        Value: 10.3233/fun-2005-67401
    Languages:
      – Code: eng
        Text: English
    PhysicalDescription:
      Pagination:
        PageCount: 20
        StartPage: 323
    Subjects:
      – SubjectFull: Deductive databases
        Type: general
      – SubjectFull: Databases
        Type: general
      – SubjectFull: Computer files
        Type: general
      – SubjectFull: Electronic information resources
        Type: general
      – SubjectFull: Programming language semantics
        Type: general
    Titles:
      – TitleFull: A New Partial Semantics for Disjunctive Deductive Databases.
        Type: main
  BibRelationships:
    HasContributorRelationships:
      – PersonEntity:
          Name:
            NameFull: Gire, Françoise
      – PersonEntity:
          Name:
            NameFull: Plourde, Corinne
    IsPartOfRelationships:
      – BibEntity:
          Dates:
            – D: 01
              M: 09
              Text: 2005
              Type: published
              Y: 2005
          Identifiers:
            – Type: issn-print
              Value: 01692968
          Numbering:
            – Type: volume
              Value: 67
            – Type: issue
              Value: 4
          Titles:
            – TitleFull: Fundamenta Informaticae
              Type: main
ResultId 1