May 23, 2006 · We describe a new class of tree automata, and a related logic on trees, with applications to the processing of XML documents and XML schemas [1 ] ...

In this paper, we define a tree logic that directly embeds XML Schema as a plain sub- set as well as a new class of automata for unranked trees, used to decide.

Sep 29, 2006 · In this paper, we introduce Sheaves Logic (SL), a new tree logic that extends the syntax of the – recursion-free fragment of – W3C XML Schema ...

Mar 6, 2017 · Abstract XML documents may be roughly described as unranked, ordered trees and it is therefore natural to use tree automata to process or ...

We describe a new class of tree automata, and a related logic on trees, with applications to the processing of XML documents and XML schemas.

In this paper, we introduce Sheaves Logic (SL), a new tree logic that extends the syntax of the (recursion-free fragment of) W3C XML Schema Definition Language ...

In this paper, we define a tree logic that directly embeds XML Schema as a plain subset as well as a new class of automata for unranked trees, used to decide ...

In this paper, we define a tree logic that directly embeds XML Schema as a plain sub- set as well as a new class of automata for unranked trees, used to decide.

In this tool, the types of XML do uments (or regular expression types) are modeled by regular tree automata and the typing of pattern mat hing expressions is ...

Sheaves Logic is introduced, a new tree logic that extends the syntax of the – recursion-free fragment of – W3C XML Schema Definition Language (WXS), ...