Sciweavers

36 search results - page 6 / 8
» The complexity of reasoning about pattern-based XML schemas
Sort
View
TKDE
2012
194views Formal Methods» more  TKDE 2012»
11 years 10 months ago
A Query Formulation Language for the Data Web
— We present a query formulation language (called MashQL) in order to easily query and fuse structured data on the web. The main novelty of MashQL is that it allows people with l...
Mustafa Jarrar, Marios D. Dikaiakos
ICDT
2007
ACM
141views Database» more  ICDT 2007»
14 years 1 months ago
Exact XML Type Checking in Polynomial Time
Stay macro tree transducers (smtts) are an expressive formalism for reasoning about XSLT-like document transformations. Here, we consider the exact type checking problem for smtts....
Sebastian Maneth, Thomas Perst, Helmut Seidl
WWW
2005
ACM
14 years 8 months ago
CaTTS: calendar types and constraints for Web applications
Data referring to cultural calendars such as the widespread Gregorian dates but also dates after the Chinese, Hebrew, or Islamic calendars as well as data referring to professiona...
François Bry, Frank-André Rieß...
DOCENG
2006
ACM
14 years 1 months ago
Comparing XML path expressions
XPath is the standard declarative language for navigating XML data and returning a set of matching nodes. In the context of XSLT/XQuery analysis, query optimization, and XML type ...
Pierre Genevès, Nabil Layaïda
ISEMANTICS
2010
13 years 9 months ago
Issues in expressing metadata application profiles with description logics and OWL 2
This paper gives an account of how traditional metadata application profiles are related to Web ontologies and Description Logics. It is shown that metadata profiles can be formal...
Dimitrios A. Koutsomitropoulos, Georgia D. Solomou