Year: 2016
Type: article
Abstract: The article studies the rewriting mechanisms for intensional documents in the Active XML framework, abstracted in the form of active context-free games . The safe rewriting problem studied in this article is to decide whether the first player, JULIET , has a winning strategy for a given game and (nested) word; this corresponds to a successful rewriting strategy for a given intensional document. The article examines several extensions of active context-free games. The primary extension allows for more expressive schemas (namely XML schemas and regular nested word languages) for both target and replacement languages and has the effect that games are played on nested words instead of (flat) words as in previous studies. Other extensions consider validation of input parameters of web services, and an alternative semantics based on insertion of values returned by the services. In general, the complexity of the safe rewriting problem is highly intractable (doubly exponential time), but the article identifies relevant tractable cases.
Source: Theory of Computing Systems
Authors: Martin Schuster, Thomas Schwentick
Institution: TU Dortmund University
Language: English
Subfield: Computer Networks and Communications
Field: Computer Science
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W1580005738