View in EDS PDF Full Text

Processing Indefinite Deductive Databases under the Possible Model Semantics.

Saved in:
Bibliographic Details
Title: Processing Indefinite Deductive Databases under the Possible Model Semantics.
Authors: Johnson, C.A.
Source: Fundamenta Informaticae. Feb2002, Vol. 49 Issue 4, p325. 23p.
Subjects: Deductive databases, Stratificational grammar, Databases
Abstract: Focuses on a study on the relationship between possible and supported models of unstratified indefinite deductive databases, when disjunction is interpreted inclusively. Definition of indefinite deductive database; Discussion on exclusive versus inclusive disjunction; Possible and supported models; Characteristics of stratified databases.
Database: Engineering Source
FullText Links:
  – Type: pdflink
Text:
  Availability: 0
Header DbId: egs
DbLabel: Engineering Source
An: 6412931
AccessLevel: 6
PubType: Academic Journal
PubTypeId: academicJournal
PreciseRelevancyScore: 0
IllustrationInfo
Items – Name: Title
  Label: Title
  Group: Ti
  Data: Processing Indefinite Deductive Databases under the Possible Model Semantics.
– Name: Author
  Label: Authors
  Group: Au
  Data: <searchLink fieldCode="AR" term="%22Johnson%2C+C%2EA%2E%22">Johnson, C.A.</searchLink>
– Name: TitleSource
  Label: Source
  Group: Src
  Data: <searchLink fieldCode="JN" term="%22Fundamenta+Informaticae%22">Fundamenta Informaticae</searchLink>. Feb2002, Vol. 49 Issue 4, p325. 23p.
– Name: Subject
  Label: Subjects
  Group: Su
  Data: <searchLink fieldCode="DE" term="%22Deductive+databases%22">Deductive databases</searchLink><br /><searchLink fieldCode="DE" term="%22Stratificational+grammar%22">Stratificational grammar</searchLink><br /><searchLink fieldCode="DE" term="%22Databases%22">Databases</searchLink>
– Name: Abstract
  Label: Abstract
  Group: Ab
  Data: Focuses on a study on the relationship between possible and supported models of unstratified indefinite deductive databases, when disjunction is interpreted inclusively. Definition of indefinite deductive database; Discussion on exclusive versus inclusive disjunction; Possible and supported models; Characteristics of stratified databases.
PLink https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&db=egs&AN=6412931
RecordInfo BibRecord:
  BibEntity:
    Identifiers:
      – Type: doi
        Value: 10.3233/fun-2002-49404
    Languages:
      – Code: eng
        Text: English
    PhysicalDescription:
      Pagination:
        PageCount: 23
        StartPage: 325
    Subjects:
      – SubjectFull: Deductive databases
        Type: general
      – SubjectFull: Stratificational grammar
        Type: general
      – SubjectFull: Databases
        Type: general
    Titles:
      – TitleFull: Processing Indefinite Deductive Databases under the Possible Model Semantics.
        Type: main
  BibRelationships:
    HasContributorRelationships:
      – PersonEntity:
          Name:
            NameFull: Johnson, C.A.
    IsPartOfRelationships:
      – BibEntity:
          Dates:
            – D: 01
              M: 02
              Text: Feb2002
              Type: published
              Y: 2002
          Identifiers:
            – Type: issn-print
              Value: 01692968
          Numbering:
            – Type: volume
              Value: 49
            – Type: issue
              Value: 4
          Titles:
            – TitleFull: Fundamenta Informaticae
              Type: main
ResultId 1