A Rule-Based Approach to XML Processing and Web Reasoning

Coelho, Jorge; Dundua, Besik; Florido, Mário; Kutsia, Temur

doi:10.1007/978-3-642-15918-3_13

Cited by 7 publications

(3 citation statements)

References 20 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In recent years, the rule-based approach has experienced growing popularity in XML applications [24]. Nevertheless, as far as we know, there has been little exploration of the rewriting-based techniques for the repairing of XML repositories to date.…”

Section: Introductionmentioning

confidence: 99%

“…A related rewriting-based approach is [26], which defines HTML transformations with the aim of improving Web applications by cleaning up syntax, reorganizing frames, or updating to new standards. The work in [24] defines a rule-based approach to XML processing and Web reasoning that uses an extension of logic programming using unranked signatures (flexible arity, i.e., variadic symbols) and advanced rule-based programming features for hedge (aka unranked term sequence) transformations, strategies, and regular constraints. A Rewriting Logic approach to the formal specification and verification of dynamic Web applications can be found in [27].…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Rewriting-based repairing strategies for XML repositories

Alpuente

Ballis

Falaschi³

et al. 2013

The Journal of Logic and Algebraic Programming

View full text Add to dashboard Cite

Keeping XML data in a consistent state w.r.t. both structure and content is a burdensome task. To maintain the consistency of ever-larger, complex XML repositories, suitable mechanisms that are able to fix every possible inconsistency are needed. In this article, we present a methodology for semi-automatically repairing faulty XML repositories that can be integrated on top of an existing rewriting-based verification engine. As a formal basis for representing consistency criteria, we use a rule-based description formalism that is realized in the language Maude. Then, starting from a categorization of the kinds of errors that can be found during the verification process, we formulate a stepwise transformation procedure that achieves correctness and completeness of the XML repository w.r.t. its Maude formal specification while strictly observing the structure of the XML documents. With the aim of increasing the level of automation of our repair methodology, we also define two correction strategies and two completion strategies that reduce either the amount of information to be changed or the number of repair actions to be executed in order to deliver an XML repository that is both correct and complete. Finally, we describe a prototype implementation of the repairing tool, which we use for an experimental evaluation of our method with good results.

show abstract

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Rewriting-based repairing strategies for XML repositories

Alpuente

Ballis

Falaschi³

et al. 2013

The Journal of Logic and Algebraic Programming

View full text Add to dashboard Cite

show abstract

“…In recent years usefulness of sequence and context variables has been shown in various areas of mathematics and computer science. Sequence variables are placeholders for arbitrarily long finite sequences of expressions and have applications in programming (Wolfram, 2003), XML querying and transformation (Coelho, Dundua, Florido, & Kutsia, 2010), knowledge engineering and artificial intelligence (Volpano, 1994), and automated reasoning (Ginsberg, 1991). Context variables are placeholders for contexts, which are functional expressions whose applicative behavior is to replace a special constant (so called hole) with the expression given as argument.…”

mentioning

confidence: 99%