View in EDS

Temporal stratification tests for linear and branching-time deductive databases

Saved in:
Bibliographic Details
Title: Temporal stratification tests for linear and branching-time deductive databases
Authors: Nomikos, Christos1 cnomikos@cs.uoi.gr, Rondogiannis, Panos2 prondo@di.uoa.gr, Gergatsoulis, Manolis3 manolis@ionio.gr
Source: Theoretical Computer Science. Sep2005, Vol. 342 Issue 2/3, p382-415. 34p.
Subjects: Deductive databases, Databases, Computer files, Electronic information resources
Abstract: Abstract: We consider the problem of extending temporal deductive databases with stratified negation. We argue that the classical stratification test for deductive databases is too restrictive when one shifts attention to the temporal case. Moreover, as we demonstrate, the (more general) local stratification approach is impractical: detecting whether a temporal deductive database is locally stratified is shown to be co-NP hard (even if one restricts attention to programs that only use one predicate symbol and two constants). For these reasons we define temporal stratification, an intermediate notion between stratification and local stratification. We demonstrate that for the temporal deductive databases we consider, temporal stratification coincides with local stratification in certain important cases in which the latter is polynomial-time decidable. We then develop two algorithms for detecting temporal stratification. The first algorithm applies to linear-time temporal deductive databases and it is efficient and more general than existing approaches; however, the algorithm sacrifices completeness for efficiency since it does not cover the whole class of temporally stratified programs. The second algorithm applies to branching-time temporal deductive databases (which include as a special case the linear-time ones). This algorithm is more expensive from a computational point of view, but it covers the whole class of temporally stratified programs. We discuss the relative merits of the two algorithms and compare them with other existing approaches. [Copyright &y& Elsevier]
Copyright of Theoretical Computer Science is the property of Elsevier B.V. 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 Text:
  Availability: 0
Header DbId: egs
DbLabel: Engineering Source
An: 18235419
AccessLevel: 6
PubType: Academic Journal
PubTypeId: academicJournal
PreciseRelevancyScore: 0
IllustrationInfo
Items – Name: Title
  Label: Title
  Group: Ti
  Data: Temporal stratification tests for linear and branching-time deductive databases
– Name: Author
  Label: Authors
  Group: Au
  Data: <searchLink fieldCode="AR" term="%22Nomikos%2C+Christos%22">Nomikos, Christos</searchLink><relatesTo>1</relatesTo><i> cnomikos@cs.uoi.gr</i><br /><searchLink fieldCode="AR" term="%22Rondogiannis%2C+Panos%22">Rondogiannis, Panos</searchLink><relatesTo>2</relatesTo><i> prondo@di.uoa.gr</i><br /><searchLink fieldCode="AR" term="%22Gergatsoulis%2C+Manolis%22">Gergatsoulis, Manolis</searchLink><relatesTo>3</relatesTo><i> manolis@ionio.gr</i>
– Name: TitleSource
  Label: Source
  Group: Src
  Data: <searchLink fieldCode="JN" term="%22Theoretical+Computer+Science%22">Theoretical Computer Science</searchLink>. Sep2005, Vol. 342 Issue 2/3, p382-415. 34p.
– 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>
– Name: Abstract
  Label: Abstract
  Group: Ab
  Data: Abstract: We consider the problem of extending temporal deductive databases with stratified negation. We argue that the classical stratification test for deductive databases is too restrictive when one shifts attention to the temporal case. Moreover, as we demonstrate, the (more general) local stratification approach is impractical: detecting whether a temporal deductive database is locally stratified is shown to be co-NP hard (even if one restricts attention to programs that only use one predicate symbol and two constants). For these reasons we define temporal stratification, an intermediate notion between stratification and local stratification. We demonstrate that for the temporal deductive databases we consider, temporal stratification coincides with local stratification in certain important cases in which the latter is polynomial-time decidable. We then develop two algorithms for detecting temporal stratification. The first algorithm applies to linear-time temporal deductive databases and it is efficient and more general than existing approaches; however, the algorithm sacrifices completeness for efficiency since it does not cover the whole class of temporally stratified programs. The second algorithm applies to branching-time temporal deductive databases (which include as a special case the linear-time ones). This algorithm is more expensive from a computational point of view, but it covers the whole class of temporally stratified programs. We discuss the relative merits of the two algorithms and compare them with other existing approaches. [Copyright &y& Elsevier]
– Name: AbstractSuppliedCopyright
  Label:
  Group: Ab
  Data: <i>Copyright of Theoretical Computer Science is the property of Elsevier B.V. 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=18235419
RecordInfo BibRecord:
  BibEntity:
    Identifiers:
      – Type: doi
        Value: 10.1016/j.tcs.2005.05.014
    Languages:
      – Code: eng
        Text: English
    PhysicalDescription:
      Pagination:
        PageCount: 34
        StartPage: 382
    Subjects:
      – SubjectFull: Deductive databases
        Type: general
      – SubjectFull: Databases
        Type: general
      – SubjectFull: Computer files
        Type: general
      – SubjectFull: Electronic information resources
        Type: general
    Titles:
      – TitleFull: Temporal stratification tests for linear and branching-time deductive databases
        Type: main
  BibRelationships:
    HasContributorRelationships:
      – PersonEntity:
          Name:
            NameFull: Nomikos, Christos
      – PersonEntity:
          Name:
            NameFull: Rondogiannis, Panos
      – PersonEntity:
          Name:
            NameFull: Gergatsoulis, Manolis
    IsPartOfRelationships:
      – BibEntity:
          Dates:
            – D: 07
              M: 09
              Text: Sep2005
              Type: published
              Y: 2005
          Identifiers:
            – Type: issn-print
              Value: 03043975
          Numbering:
            – Type: volume
              Value: 342
            – Type: issue
              Value: 2/3
          Titles:
            – TitleFull: Theoretical Computer Science
              Type: main
ResultId 1