کد مقاله کد نشریه سال انتشار مقاله انگلیسی نسخه تمام متن
4951204 1441194 2017 37 صفحه PDF دانلود رایگان
عنوان انگلیسی مقاله ISI
Axiomatizations for downward XPath on data trees
موضوعات مرتبط
مهندسی و علوم پایه مهندسی کامپیوتر نظریه محاسباتی و ریاضیات
پیش نمایش صفحه اول مقاله
Axiomatizations for downward XPath on data trees
چکیده انگلیسی
We give sound and complete axiomatizations for XPath with data tests by 'equality' or 'inequality', and containing the single 'child' axis. This data-aware logic predicts over data trees, which are tree-like structures whose every node contains a label from a finite alphabet and a data value from an infinite domain. The language allows us to compare data values of two nodes but cannot access the data values themselves (i.e. there is no comparison by constants). Our axioms are in the style of equational logic, extending the axiomatization of data-oblivious XPath, by B. ten Cate, T. Litak and M. Marx. We axiomatize the full logic with tests by 'equality' and 'inequality', and also a simpler fragment with 'equality' tests only. Our axiomatizations apply both to node expressions and path expressions. The proof of completeness relies on a novel normal form theorem for XPath with data tests.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Journal of Computer and System Sciences - Volume 89, November 2017, Pages 209-245
نویسندگان
, , , ,