1. On Core XPath with Inflationary Fixed Points.
- Author
-
Afanasiev, Loredana and Cate, Balder ten
- Subjects
XPATH (Computer program language) ,FIXED point theory ,SATISFIABILITY (Computer science) ,PROBLEM solving ,GODEL'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]
- Published
- 2013
- Full Text
- View/download PDF