892 search results - page 67 / 179 » et 2007 |
RTA
2007
Springer
14 years 3 months ago
2007
Springer
We present a method of lifting to explicit substitution calculi some characterizations of the strongly normalizing terms of λ-calculus by means of intersection type systems. The m...
RTA
2007
Springer
14 years 3 months ago
2007
Springer
The use of automata techniques to prove the termination of string rewrite systems and left-linear term rewrite systems is advocated by Geser et al. in a recent sequence of papers. ...
AAAI
2007
13 years 11 months ago
2007
This paper reports on our recent work on modeling and automatically extracting vague, implicit event durations from text (Pan et al., 2006a, 2006b). It is a kind of commonsense kn...
FLAIRS
2007
13 years 11 months ago
2007
Despite extensive theoretical work carried out on coordination during the last three decades, much research is still devoted to proving the merits of one model over another. In ou...
CORR
2007
Springer
13 years 8 months ago
2007
Springer
Abstract. Processing compressed strings without decompression is often essential when dealing with massive data sets. We consider local subsequence recognition problems on strings ...