Sciweavers

134 search results - page 21 / 27
» Using Regular Tree Automata as XML Schemas
Sort
View
CORR
2010
Springer
103views Education» more  CORR 2010»
13 years 6 months ago
Probabilistic regular graphs
Deterministic graph grammars generate regular graphs, that form a structural extension of configuration graphs of pushdown systems. In this paper, we study a probabilistic extensio...
Nathalie Bertrand, Christophe Morvan
SEBD
2003
159views Database» more  SEBD 2003»
13 years 8 months ago
Spatial Tree Logics to reason about Semistructured Data
The Ambient Logic is a modal logic proposed to describe the structural and computational properties of distributed and mobile computations. The static part of the Ambient Logic is,...
Giovanni Conforti, Giorgio Ghelli
LICS
2008
IEEE
14 years 1 months ago
Winning Regions of Higher-Order Pushdown Games
In this paper we consider parity games defined by higher-order pushdown automata. These automata generalise pushdown automata by the use of higher-order stacks, which are nested ...
Arnaud Carayol, Matthew Hague, Antoine Meyer, C.-H...
BNCOD
2008
143views Database» more  BNCOD 2008»
13 years 8 months ago
Reconciling Inconsistent Data in Probabilistic XML Data Integration
Abstract. The problem of dealing with inconsistent data while integrating XML data from different sources is an important task, necessary to improve data integration quality. Typic...
Tadeusz Pankowski
PODS
2010
ACM
242views Database» more  PODS 2010»
13 years 11 months ago
Certain answers for XML queries
The notion of certain answers arises when one queries incompletely specified databases, e.g., in data integration and exchange scenarios, or databases with missing information. W...
Claire David, Leonid Libkin, Filip Murlak