4,092 research outputs found
Four Lessons in Versatility or How Query Languages Adapt to the Web
Exposing not only human-centered information, but machine-processable data on the Web is one of the commonalities of recent Web trends. It has enabled a new kind of applications and businesses where the data is used in ways not foreseen by the data providers. Yet this exposition has fractured the Web into islands of data, each in different Web formats: Some providers choose XML, others RDF, again others JSON or OWL, for their data, even in similar domains. This fracturing stifles innovation as application builders have to cope not only with one Web stack (e.g., XML technology) but with several ones, each of considerable complexity. With Xcerpt we have developed a rule- and pattern based query language that aims to give shield application builders from much of this complexity: In a single query language XML and RDF data can be accessed, processed, combined, and re-published. Though the need for combined access to XML and RDF data has been recognized in previous work (including the W3Cās GRDDL), our approach differs in four main aspects: (1) We provide a single language (rather than two separate or embedded languages), thus minimizing the conceptual overhead of dealing with disparate data formats. (2) Both the declarative (logic-based) and the operational semantics are unified in that they apply for querying XML and RDF in the same way. (3) We show that the resulting query language can be implemented reusing traditional database technology, if desirable. Nevertheless, we also give a unified evaluation approach based on interval labelings of graphs that is at least as fast as existing approaches for tree-shaped XML data, yet provides linear time and space querying also for many RDF graphs. We believe that Web query languages are the right tool for declarative data access in Web applications and that Xcerpt is a significant step towards a more convenient, yet highly efficient data access in a āWeb of Dataā
Undecidability of the unification and admissibility problems for modal and description logics
We show that the unification problem `is there a substitution instance of a
given formula that is provable in a given logic?' is undecidable for basic
modal logics K and K4 extended with the universal modality. It follows that the
admissibility problem for inference rules is undecidable for these logics as
well. These are the first examples of standard decidable modal logics for which
the unification and admissibility problems are undecidable. We also prove
undecidability of the unification and admissibility problems for K and K4 with
at least two modal operators and nominals (instead of the universal modality),
thereby showing that these problems are undecidable for basic hybrid logics.
Recently, unification has been introduced as an important reasoning service for
description logics. The undecidability proof for K with nominals can be used to
show the undecidability of unification for boolean description logics with
nominals (such as ALCO and SHIQO). The undecidability proof for K with the
universal modality can be used to show that the unification problem relative to
role boxes is undecidable for Boolean description logic with transitive roles,
inverse roles, and role hierarchies (such as SHI and SHIQ)
- ā¦