In:
RAIRO - Theoretical Informatics and Applications, EDP Sciences, Vol. 47, No. 1 ( 2013-1), p. 3-23
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.
Type of Medium:
Online Resource
ISSN:
0988-3754
,
1290-385X
Language:
English
Publisher:
EDP Sciences
Publication Date:
2013
detail.hit.zdb_id:
1492140-6