110 search results - page 14 / 22 » Restrictions on Tree Adjoining Languages |
128
Voted
FSTTCS
2007
Springer
15 years 5 months ago
2007
Springer
Abstract. We investigate streaming evaluation of filters on XML documents, evaluated both at the root node and at an arbitrary node. Motivated by applications in protocol processin...
138
click to vote
RTA
2005
Springer
15 years 7 months ago
2005
Springer
We present a new method for proving termination of term rewriting systems automatically. It is a generalization of the match bound method for string rewriting. To prove that a term...
117
click to vote
CONCUR
2006
Springer
15 years 3 months ago
2006
Springer
In regular inference, the problem is to infer a regular language, typically represented by a deterministic finite automaton (DFA) from answers to a finite set of membership querie...
137
Voted
DIS
2001
Springer
15 years 6 months ago
2001
Springer
In the context of classification problems, algorithms that generate multivariate trees are able to explore multiple representation languages by using decision tests based on a com...
167
Voted
CSCLP
2008
Springer
15 years 3 months ago
2008
Springer
In this paper, we present a rule-based modelling language for constraint programming, called Rules2CP. Unlike other modelling languages, Rules2CP adopts a single knowledge represen...