1445 search results - page 78 / 289 » Uniformly Hard Languages |
138
click to vote
ICWS
2007
IEEE
15 years 5 months ago
2007
IEEE
In this paper we describe a platform that supports context aware runtime service discovery. The platform supports service discovery based on structural and behavioural service mod...
115
click to vote
DLT
2006
15 years 5 months ago
2006
Let be an alphabet of size t, let f : be a non-erasing morphism, let w be an infinite fixed point of f, and let E(w) be the critical exponent of w. We prove that if E(w) is fi...
137
click to vote
ACL
1992
15 years 5 months ago
1992
In natural language processing, ambiguity resolution is a central issue, and can be regarded as a preference assignment problem. In this paper, a Generalized Probabilistic Semanti...
134
click to vote
ACL
1990
15 years 5 months ago
1990
We discuss algorithms for generation within the Lambek Theorem Proving Framework. Efficient algorithms for generation in this framework take a semantics-driven strategy. This stra...
153
click to vote
MSCS
2000
15 years 3 months ago
2000
This paper introduces a Hilbert system for lambda calculus called sequent combinators. Sequent combinators address many of the problems of Hilbert systems, which have led to the m...