This paper describes an approach to the treatment of nominal compounds in a machine translation project employing a modern unification-based system. General problems connected wit...
Pierrette Bouillon, Katharina Boesefeldt, Graham R...
It is shown that the decision problem for the temporal logic with until and since connectives over real-numbers time is PSPACE-complete. This is the most practically useful dense ...
: In this paper we deal with the construction of gap functions for variational inequalities by using an approach which bases on the conjugate duality. Under certain assumptions we ...
The paper proposes a formal delimitation of the class of `fuzzy logics' and answers some objections that can be raised against the definition; the focus is put on informal an...
In this paper we study the scheduling of multiple divisible loads on a star network of processors. We show that this problem is computationally hard. Special cases solvable in pol...