524 search results - page 8 / 105 » Context Trees |
118
Voted
COLT
1992
Springer
15 years 6 months ago
1992
Springer
This paper deals with a class of Prolog programs, called context-free term transformations (CFT). We present a polynomial time algorithm to identify a subclass of CFT, whose progr...
129
Voted
ENTCS
2010
15 years 2 months ago
2010
Solutions of recursive program schemes over a given signature were characterized by Bruno Courcelle as precisely the context-free (or algebraic) -trees. These are the finite and ...
147
click to vote
CHI
2001
ACM
16 years 3 months ago
2001
ACM
Eye tracking studies of the Hyperbolic Tree browser [10] suggest that visual search in focus+context displays is highly affected by information scent (i.e., local cues, such as te...
107
Voted
INLG
2004
Springer
15 years 8 months ago
2004
Springer
This paper describes an implemented model of context-based incremental tactical generation within the Dynamic Syntax framework [1] which directly reflects dialogue phenomena such ...
108
Voted
CADE
2005
Springer
16 years 3 months ago
2005
Springer
Abstract. Context unification (CU) is the open problem of solving context equations for trees. We distinguish a new decidable variant of CU? well-nested CU ? and present a new unif...