For a long time categorial grammars were regarded as "toys grammars". Indeed, in spite of a very solid theoretical base, categorial grammars remain rather marginal as so...
In this chapter, we propose a new practical codification of the elements of the Venn diagram in order to easily manipulate the focal elements. In order to reduce the complexity, t...
The maximum constraint satisfaction problem (Max CSP) is the following computational problem: an instance is a finite collection of constraints on a set of variables, and the goal...
Peter Jonsson, Andrei A. Krokhin, Fredrik Kuivinen
The enforcement of semantic integrity constraints in data and knowledge bases constitutea a major performance bottleneck. Integrity constraint simplification methods aim at reduci...
— Many methods exist for the automatic and optimal 3D reconstruction of camera motion and scene structure from image sequence (’Structure from Motion‘ or SfM). The solution t...