Sciweavers

BIRTHDAY
2009
Springer
14 years 7 months ago
No Syllogisms for the Numerical Syllogistic
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...
Ian Pratt-Hartmann
BIRTHDAY
2009
Springer
14 years 7 months ago
Formal Grammars of Early Language
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...
Shuly Wintner, Alon Lavie, Brian MacWhinney
BIRTHDAY
2009
Springer
14 years 7 months ago
Hybrid BDD and All-SAT Method for Model Checking
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...
Avi Yadgar, Orna Grumberg, Assaf Schuster
BIRTHDAY
2009
Springer
14 years 7 months ago
Semi-formal Evaluation of Conversational Characters
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 ...
Ron Artstein, Sudeep Gandhe, Jillian Gerten, Anton...
BIRTHDAY
2009
Springer
14 years 7 months ago
Nonassociative Lambek Calculus with Additives and Context-Free Languages
We study Nonassociative Lambek Calculus with additives ∧, ∨, satisfying the distributive law (Distributive Full Nonassociative Lambek Calculus DFNL). We prove that categorial g...
Wojciech Buszkowski, Maciej Farulewski
BIRTHDAY
2009
Springer
14 years 7 months ago
No i-Sums for Nissim (and Shalom)
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...
Itamar Francez
BIRTHDAY
2009
Springer
14 years 7 months ago
On Lazy Commutation
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...
Nachum Dershowitz
BIRTHDAY
2009
Springer
14 years 7 months ago
Formal Series of General Algebras over a Field and Their Syntactic Algebras
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...
Zoltán Fülöp, Magnus Steinby
BIRTHDAY
2009
Springer
14 years 7 months ago
Social Modeling and i*
Eric S. K. Yu