Sciweavers

234 search results - page 38 / 47
» On Quasi-Products of Tree Automata
Sort
View
ICDE
2010
IEEE
288views Database» more  ICDE 2010»
16 years 1 months ago
Fast In-Memory XPath Search using Compressed Indexes
A large fraction of an XML document typically consists of text data. The XPath query language allows text search via the equal, contains, and starts-with predicates. Such predicate...
Diego Arroyuelo, Francisco Claude, Sebastian Manet...
WIA
2000
Springer
15 years 4 months ago
MONA Implementation Secrets
The Mona tool provides an implementation of the decision procedures for the logics WS1S and WS2S. It has been used for numerous applications, and it is remarkably efficient in prac...
Nils Klarlund, Anders Møller, Michael I. Sc...
DAGM
2008
Springer
15 years 3 months ago
Natural Language Understanding by Combining Statistical Methods and Extended Context-Free Grammars
This paper introduces an novel framework for speech understanding using extended context-free grammars (ECFGs) by combining statistical methods and rule based knowledge. By only us...
Stefan Schwärzler, Joachim Schenk, Frank Wall...
JAPLL
2010
124views more  JAPLL 2010»
14 years 11 months ago
Reasoning about XML with temporal logics and automata
We show that problems arising in static analysis of XML specifications and transformations can be dealt with using techniques similar to those developed for static analysis of pr...
Leonid Libkin, Cristina Sirangelo
PODS
2004
ACM
86views Database» more  PODS 2004»
16 years 1 months ago
Frontiers of Tractability for Typechecking Simple XML Transformations
Typechecking consists of statically verifying whether the output of an XML transformation is always conform to an output type for documents satisfying a given input type. We focus...
Wim Martens, Frank Neven