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 |
