Sciweavers

38 search results - page 2 / 8
» Restricted Walks in Regular Trees
Sort
View
LICS
2005
IEEE
13 years 10 months ago
Looping Caterpillars
There are two main paradigms for querying semi structured data: regular path queries and XPath. The aim of this paper is to provide a synthesis between these two. This synthesis i...
Evan Goris, Maarten Marx
PODS
2008
ACM
143views Database» more  PODS 2008»
14 years 4 months ago
XPath, transitive closure logic, and nested tree walking automata
We consider the navigational core of XPath, extended with two operators: the Kleene star for taking the transitive closure of path expressions, and a subtree relativisation operat...
Balder ten Cate, Luc Segoufin
CORR
2008
Springer
108views Education» more  CORR 2008»
13 years 4 months ago
Resolution Trees with Lemmas: Resolution Refinements that Characterize DLL Algorithms with Clause Learning
Resolution refinements called w-resolution trees with lemmas (WRTL) and with input lemmas (WRTI) are introduced. Dag-like resolution is equivalent to both WRTL and WRTI when there...
Samuel R. Buss, Jan Hoffmann 0002, Jan Johannsen
CORR
2008
Springer
107views Education» more  CORR 2008»
13 years 4 months ago
Maximum Entropy Rate of Markov Sources for Systems With Non-regular Constraints
Using the concept of discrete noiseless channels, it was shown by Shannon in A Mathematical Theory of Communication that the ultimate performance of an encoder for a constrained sy...
Georg Böcherer, Valdemar Cardoso da Rocha Jr....
RTA
2000
Springer
13 years 8 months ago
Linear Second-Order Unification and Context Unification with Tree-Regular Constraints
Linear Second-Order Unification and Context Unification are closely related problems. However, their equivalence was never formally proved. Context unification is a restriction of ...
Jordi Levy, Mateu Villaret