View in EDS PDF Full Text

On Core XPath with Inflationary Fixed Points.

Saved in:
Bibliographic Details
Title: On Core XPath with Inflationary Fixed Points.
Authors: Afanasiev, Loredana1 loredana.afanasiev@gmail.com, Cate, Balder ten2 btencate@ucsc.edu
Source: RAIRO - Theoretical Informatics & Applications. Jan2013, Vol. 47 Issue 1, p3-23. 21p. 1 Black and White Photograph.
Subjects: XPath (Computer program language), Fixed point theory, Satisfiability (Computer science), Problem solving, Gödel's theorem
Abstract: We prove the undecidability of Core XPath 1.0 (CXP) [G. Gottlob and C. Koch, in Proc. of 17th Ann. IEEE Symp. on Logic in Computer Science, LICS ’02 (Copenhagen, July 2002). IEEE CS Press (2002) 189–202.] extended with an Inflationary Fixed Point (IFP) operator. More specifically, we prove that the satisfiability problem of this language is undecidable. In fact, the fragment of CXP+IFP containing only the self and descendant axes is already undecidable. [ABSTRACT FROM PUBLISHER]
Copyright of RAIRO - Theoretical Informatics & Applications is the property of EDP Sciences 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: 88233295
AccessLevel: 6
PubType: Academic Journal
PubTypeId: academicJournal
PreciseRelevancyScore: 0
IllustrationInfo
Items – Name: Title
  Label: Title
  Group: Ti
  Data: On Core XPath with Inflationary Fixed Points.
– Name: Author
  Label: Authors
  Group: Au
  Data: <searchLink fieldCode="AR" term="%22Afanasiev%2C+Loredana%22">Afanasiev, Loredana</searchLink><relatesTo>1</relatesTo><i> loredana.afanasiev@gmail.com</i><br /><searchLink fieldCode="AR" term="%22Cate%2C+Balder+ten%22">Cate, Balder ten</searchLink><relatesTo>2</relatesTo><i> btencate@ucsc.edu</i>
– Name: TitleSource
  Label: Source
  Group: Src
  Data: <searchLink fieldCode="JN" term="%22RAIRO+-+Theoretical+Informatics+%26+Applications%22">RAIRO - Theoretical Informatics & Applications</searchLink>. Jan2013, Vol. 47 Issue 1, p3-23. 21p. 1 Black and White Photograph.
– Name: Subject
  Label: Subjects
  Group: Su
  Data: <searchLink fieldCode="DE" term="%22XPath+%28Computer+program+language%29%22">XPath (Computer program language)</searchLink><br /><searchLink fieldCode="DE" term="%22Fixed+point+theory%22">Fixed point theory</searchLink><br /><searchLink fieldCode="DE" term="%22Satisfiability+%28Computer+science%29%22">Satisfiability (Computer science)</searchLink><br /><searchLink fieldCode="DE" term="%22Problem+solving%22">Problem solving</searchLink><br /><searchLink fieldCode="DE" term="%22Gödel's+theorem%22">Gödel's theorem</searchLink>
– Name: Abstract
  Label: Abstract
  Group: Ab
  Data: We prove the undecidability of Core XPath 1.0 (CXP) [G. Gottlob and C. Koch, in Proc. of 17th Ann. IEEE Symp. on Logic in Computer Science, LICS ’02 (Copenhagen, July 2002). IEEE CS Press (2002) 189–202.] extended with an Inflationary Fixed Point (IFP) operator. More specifically, we prove that the satisfiability problem of this language is undecidable. In fact, the fragment of CXP+IFP containing only the self and descendant axes is already undecidable. [ABSTRACT FROM PUBLISHER]
– Name: AbstractSuppliedCopyright
  Label:
  Group: Ab
  Data: <i>Copyright of RAIRO - Theoretical Informatics & Applications is the property of EDP Sciences 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=88233295
RecordInfo BibRecord:
  BibEntity:
    Identifiers:
      – Type: doi
        Value: 10.1051/ita/2012027
    Languages:
      – Code: eng
        Text: English
    PhysicalDescription:
      Pagination:
        PageCount: 21
        StartPage: 3
    Subjects:
      – SubjectFull: XPath (Computer program language)
        Type: general
      – SubjectFull: Fixed point theory
        Type: general
      – SubjectFull: Satisfiability (Computer science)
        Type: general
      – SubjectFull: Problem solving
        Type: general
      – SubjectFull: Gödel's theorem
        Type: general
    Titles:
      – TitleFull: On Core XPath with Inflationary Fixed Points.
        Type: main
  BibRelationships:
    HasContributorRelationships:
      – PersonEntity:
          Name:
            NameFull: Afanasiev, Loredana
      – PersonEntity:
          Name:
            NameFull: Cate, Balder ten
    IsPartOfRelationships:
      – BibEntity:
          Dates:
            – D: 01
              M: 01
              Text: Jan2013
              Type: published
              Y: 2013
          Identifiers:
            – Type: issn-print
              Value: 28047346
          Numbering:
            – Type: volume
              Value: 47
            – Type: issue
              Value: 1
          Titles:
            – TitleFull: RAIRO - Theoretical Informatics & Applications
              Type: main
ResultId 1