Sciweavers

50 search results - page 1 / 10
» Magic Sets for the XPath Language
Sort
View
JUCS
2006
76views more  JUCS 2006»
13 years 10 months ago
Magic Sets for the XPath Language
Jesús Manuel Almendros-Jiménez, Anto...
IJSSE
2011
127views more  IJSSE 2011»
13 years 5 months ago
A Formal Language for XML Authorisations Based on Answer Set Programming and Temporal Interval Logic Constraints
The Extensible Markup Language is susceptible to security breaches because it does not incorporate methods to protect the information it encodes. Our work presented in this paper f...
Sean Policarpio, Yan Zhang
JAPLL
2010
104views more  JAPLL 2010»
13 years 9 months ago
Complete axiomatizations for XPath fragments
We provide complete axiomatizations for several fragments of XPath: sets of equivalences from which every other valid equivalence is derivable. Specifically, we axiomatize downwar...
Balder ten Cate, Tadeusz Litak, Maarten Marx
CORR
2006
Springer
122views Education» more  CORR 2006»
13 years 11 months ago
On the complexity of XPath containment in the presence of disjunction, DTDs, and variables
XPath is a simple language for navigating an XML-tree and returning a set of answer nodes. The focus in this paper is on the complexity of the containment problem for various frag...
Frank Neven, Thomas Schwentick
ICDT
2005
ACM
139views Database» more  ICDT 2005»
14 years 4 months ago
First Order Paths in Ordered Trees
We give two sufficient conditions on XPath like languages for having first order expressivity, meaning that every first order definable set of paths in an ordered node-labeled t...
Maarten Marx