We found a match
Your institution may have access to this item. Find your institution then sign in to continue.
- Title
On Core XPath with Inflationary Fixed Points.
- Authors
Afanasiev, Loredana; Cate, Balder ten
- 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.
- Subjects
XPATH (Computer program language); FIXED point theory; SATISFIABILITY (Computer science); PROBLEM solving; GODEL'S theorem
- Publication
RAIRO - Theoretical Informatics & Applications, 2013, Vol 47, Issue 1, p3
- ISSN
2804-7346
- Publication type
Article
- DOI
10.1051/ita/2012027