4573 search results - page 262 / 915 » Automated Reasoning |
177
click to vote
LICS
1999
IEEE
15 years 11 months ago
1999
IEEE
This paper extends the termination proof techniques based on reduction orderings to a higher-order setting, by adapting the recursive path ordering definition to terms of a typed ...
161
click to vote
LICS
1999
IEEE
15 years 11 months ago
1999
IEEE
The complexity of set constraints has been extensively studied over the last years and was often found quite high. At the lower end of expressiveness, there are atomic set constra...
174
click to vote
LICS
1999
IEEE
15 years 11 months ago
1999
IEEE
An important open question in complexity theory is whether the circuit complexity class TC0 is (strictly) weaker than LOGSPACE. This paper considers this question from the viewpoi...
157
click to vote
ESSLLI
1999
Springer
15 years 11 months ago
1999
Springer
This paper argues that exhaustification is empirically and theoretically important as a tool in the semantic description of various constructions in natural language. Discussion f...
161
click to vote
ESSLLI
1999
Springer
15 years 11 months ago
1999
Springer
Abstract. In agglutinating languages, bound morphemes can indicate grammatical functions that are realized by words in languages like English. In this paper, a morphosyntactic gene...