We study complexity of methods using rigid variables, like the method of matings or the tableau method, on a decidable class of predicate calculus with equality. We show some intr...
This paper describes an on-going study which applies the concept of transitivity to news discourse for text processing tasks. The complex notion of transitivity is defined and the...
We analyse the computational complexity of phonological models as they have developed over the past twenty years. The major results ate that generation and recognition are undecid...
The increasing complexity of products and services encourages more and more companies to form collaborative networks. As these companies are independent organizations there is oft...
The recursive descent parsing method for the context-free grammars is extended for their generalization, Boolean grammars, which include explicit set-theoretic operations in the f...