Journal of Computer and System Sciences
One-unambiguous regular languages
Information and Computation
CSL '02 Proceedings of the 16th International Workshop and 11th Annual Conference of the EACSL on Computer Science Logic
A normal form for XML documents
ACM Transactions on Database Systems (TODS)
Expressiveness of XSDs: from practice to theory, there and back again
WWW '05 Proceedings of the 14th international conference on World Wide Web
XML data exchange: consistency and query answering
Proceedings of the twenty-fourth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Journal of Computer and System Sciences
Which XML schemas admit 1-pass preorder typing?
ICDT'05 Proceedings of the 10th international conference on Database Theory
Deterministic automata on unranked trees
FCT'05 Proceedings of the 15th international conference on Fundamentals of Computation Theory
Simple off the shelf abstractions for XML schema
ACM SIGMOD Record
Succinctness of pattern-based schema languages for XML
DBPL'07 Proceedings of the 11th international conference on Database programming languages
Succinctness of pattern-based schema languages for XML
Journal of Computer and System Sciences
Developing and analyzing XSDs through BonXai
Proceedings of the VLDB Endowment
Efficient separability of regular languages by subsequences and suffixes
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part II
| Hi-index | 0.00 |
In a recent paper, Martens et al. introduced a specification mechanism for XML tree languages, based on rules of the form (r,s), wherer, s are regular expressions. Sets of such rules can be interpreted in an existential or a universal fashion. An XML tree is existentially valid with respect to a rule set, if for each node there is a rule such that the root path of the node matches r and the children sequence of the node matchess. It is universally valid if each node matching r also matchess. This paper investigates the complexity of reasoning about such rule sets, in particular the satisfiability and the implication problem. Whereas, in general these reasoning problems are complete for EXPTIME, two important fragments are identified with PSPACE and PTIME complexity, respectively.