Towards a Declarative Query and Transformation Language for XML and Semistructured Data: Simulation Unification

Bry, François; Schaffert, Sebastian

doi:10.1007/3-540-45619-8_18

Cited by 55 publications

(45 citation statements)

References 18 publications

(25 reference statements)

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…In [11], a more detailed presentation of simulation unification is given and a prototype is currently being worked on [19].…”

Section: Resultsmentioning

confidence: 99%

See 1 more Smart Citation

The XML Query Language Xcerpt: Design Principles, Examples, and Semantics

Bry¹,

Schaffert²

2003

Web, Web-Services, and Database Systems

Self Cite

View full text Add to dashboard Cite

Abstract. Most query and transformation languages developed since the mid 90es for XML and semistructured data -e.g. XQuery [1], the precursors of XQuery [2], and XSLT [3] -build upon a path-oriented node selection: A node in a data item is specified in terms of a root-to-node path in the manner of the file selection languages of operating systems. Constructs inspired from the regular expression constructs * , +, ?, and "wildcards" give rise to a flexible node retrieval from incompletely specified data items. This paper further introduces into Xcerpt, a query and transformation language further developing an alternative approach to querying XML and semistructured data first introduced with the language UnQL [4]. A metaphor for this approach views queries as patterns, answers as data items matching the queries. Formally, an answer to a query is defined as a simulation [5] of an instance of the query in a data item.

show abstract

“…In [11], a more detailed presentation of simulation unification is given and a prototype is currently being worked on [19].…”

Section: Resultsmentioning

confidence: 99%

“…It is explained in more detail in [11]. The two variables TITLE and AUTHOR will have several possible bindings as a result of the simulation unification, representing all valid combinations of a title with an author that can be found in the database, e.g.…”

Section: Query Termsmentioning

confidence: 99%

The XML Query Language Xcerpt: Design Principles, Examples, and Semantics

Bry¹,

Schaffert²

2003

Web, Web-Services, and Database Systems

Self Cite

View full text Add to dashboard Cite

show abstract

“…The following definition is inspired from [11,12] and refines the simulation considered in [13]. Recall that a (directed) rooted graph G = (V, E, r) consists in a set V of vertices, a set E of edges (i.e.…”

Section: Rooted Simulationmentioning

confidence: 99%

An Entailment Relation for Reasoning on the Web

Bry¹,

Schaffert²

2003

Rules and Rule Markup Languages for the Semantic Web

Self Cite

View full text Add to dashboard Cite

Abstract. Reasoning on the Web is receiving an increasing attention because of emerging fields such as Web adaption and Semantic Web. Indeed, the advanced functionalities striven for in these fields call for reasoning capabilities. Reasoning on the Web, however, is usually done using existing techniques rarely fitting the Web. As a consequence, additional data processing like data conversion from Web formats (e.g. XML or HTML) into some other formats (e.g. classical logic terms and formulas) is often needed and aspects of the Web (e.g. its inherent inconsistency) are neglected. This article first gives requirements for an entailment tuned to reasoning on the Web. Then, it describes how classical logic's entailment can be modified so as to enforce these requirements. Finally, it discusses how the proposed entailment can be used in applying logic programming to reasoning on the Web.

show abstract

“…XML processing in logic programming was the topic of a recent paper of Bry and Shaffert [4] where it was defined an untyped rule-based transformation language based on logic programming. Previous work on the representation of XML using a term language inspired in logic programming was presented in [5], [3] and [2].…”

Section: Xml and Logic Programmingmentioning

confidence: 99%

Type-Based XML Processing in Logic Programming

Coelho

Florido

2002

Practical Aspects of Declarative Languages

View full text Add to dashboard Cite

Abstract. In this paper we propose a type-based framework for using logic programming for XML processing. We transform XML documents into terms and DTDs into regular types. We implemented a standard type inference algorithm for logic programs and use the types corresponding to the DTDs as additional type declarations for logic programs for XML processing. Due to the correctness of the type inference this makes it possible to use logic programs as an implicitly typed processing language for XML with static type (in this case DTDs) validation. As far as we know this is the first work adding type validation at compile time to the use of logic programming for XML processing.

show abstract

Towards a Declarative Query and Transformation Language for XML and Semistructured Data: Simulation Unification

Cited by 55 publications

References 18 publications

The XML Query Language Xcerpt: Design Principles, Examples, and Semantics

The XML Query Language Xcerpt: Design Principles, Examples, and Semantics

An Entailment Relation for Reasoning on the Web

Type-Based XML Processing in Logic Programming

Contact Info

Product

Resources

About