Axiomatizing the Logical Core of XPath 2.0

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Axiomatizing core extensions

We give an axiomatization of the aspiration core on the domain of all TU-games using a relaxed feasibility condition, non-emptiness, individual rationality, and generalized versions of the reduced game property (consistency) and superadditivity. Our axioms also characterize the C-core ([Guesnerie and Oddou, 1979] and [Sun, Trockel, and Yang, 2008]) and the core on appropriate subdomains. The la...

متن کامل

Some Remarks on Axiomatizing Logical Consequence Operations

In this paper we investigate the relation between the axiomatization of a given logical consequence operation and axiom systems defining the class of algebras related to that consequence operation. We show examples which prove that, in general there are no natural relation between both ways of axiomatization.

متن کامل

On Core XPath with Inflationary Fixed Points

In this report, we prove the undecidability of Core XPath 1.0 (CXP) [6] extended with an Inflationary Fixed Point (IFP) operator. 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.

متن کامل

Relational Approach to Logical Query Optimization of XPath

To be able to handle the ever growing volumes of XML documents, effective and efficient data management solutions are needed. Managing XML data in a relational DBMS has great potential. Recently, effective relational storage schemes and index structures have been proposed as well as special-purpose join operators to speed up querying of XML data using XPath/XQuery. In this paper, we address the...

متن کامل

A Complete Axiomatization for Core Xpath 1.0

This paper provides a complete algebraic axiomatization of node and path equivalences in Core XPath 1.0. Our completeness proof builds on a completeness result of Blackburn et al. [3] for a modal logic of finite trees. This technical report is a full version of a paper in Liber Amicorum dedicated to Jan Paredaens on the occasion of his 60th birthday.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Theory of Computing Systems

سال: 2008

ISSN: 1432-4350,1433-0490

DOI: 10.1007/s00224-008-9151-9