BIRTHDAY
2009
Springer
13 years 11 months ago
2009
Springer
Abstract. We claim that user preferences are a key component of effective Web service composition, and one that has largely been ignored. In this paper we propose a means of speci...
BIRTHDAY
2009
Springer
13 years 11 months ago
2009
Springer
The numerical syllogistic is the extension of the traditional syllogistic with numerical quantifiers of the forms at least C and at most C. It is known that, for the traditional s...
BIRTHDAY
2009
Springer
13 years 11 months ago
2009
Springer
We propose to model the development of language by a series of formal grammars, accounting for the linguistic capacity of children at the very early stages of mastering language. T...
BIRTHDAY
2009
Springer
13 years 11 months ago
2009
Springer
We present a new hybrid BDD and SAT-based algorithm for model checking. Our algorithm is based on backward search, where each pre-image computation consists of an efficient All-SA...
BIRTHDAY
2009
Springer
13 years 11 months ago
2009
Springer
Conversational dialogue systems cannot be evaluated in a fully formal manner, because dialogue is heavily dependent on context and current dialogue theory is not precise enough to ...
BIRTHDAY
2009
Springer
13 years 11 months ago
2009
Springer
We study Nonassociative Lambek Calculus with additives ∧, ∨, satisfying the distributive law (Distributive Full Nonassociative Lambek Calculus DFNL). We prove that categorial g...
BIRTHDAY
2009
Springer
13 years 11 months ago
2009
Springer
Lappin and Francez (1994) present a theory of donkey anaphora which, they claim, captures both their existential and their universal readings, while maintaining a uniform represent...
BIRTHDAY
2009
Springer
13 years 11 months ago
2009
Springer
Abstract. We investigate combinatorial commutation properties for reordering a sequence of two kinds of steps, and for separating wellfoundedness of unions of relations. To that en...
BIRTHDAY
2009
Springer
13 years 11 months ago
2009
Springer
Any mapping S : C → K, where K is a field and C = (C, Σ) is a Σ-algebra, is called a KC-series. These series are natural generalizations of both formal series on strings over...
BIRTHDAY
2009
Springer
13 years 11 months ago
2009
Springer