6167 search results - page 270 / 1234 » Can Refinement be Automated |
172
Voted
CSL
2001
Springer
15 years 12 months ago
2001
Springer
We show how a well-known superposition-based inference system for first-order equational logic can be used almost directly as a decision procedure for various theories including l...
202
Voted
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...
180
Voted
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...
158
Voted
LACL
1998
Springer
15 years 11 months ago
1998
Springer
In this paper, we try to put a bridge in between Categorial Grammar and Minimalist Grammars as they result from works which follow the Chomskyan enterprise (cf Stabler ([9]), Corne...
220
Voted
LICS
1996
IEEE
15 years 11 months ago
1996
IEEE
In this note, we prove that having unique head-normal forms is a sufficient condition on partial combinatory algebras to be completable. As application,we show that the pca of str...