A main trend in CP (Constraint Programming) is to define a standard modeling language. This challenge is not a minor matter whose success may depend on many years of experimental steps. Several concerns must be studied such as the simplicity, the level of expressiveness and a suitable solver-independent architecture. In this paper we introduce the s-COMMA modeling language and its execution pla...

We first describe a multi-agent system managing a corporate memory in the form of a corporate semantic web. We then focus on a newly introduced society of agents in charge of wrapping external HTML documents that are relevant to the activities of the organization, by extracting semantic Web annotations using tailored XSLT templates. Agents and corporate semantic webs Organizations are entities ...

We present a comparative study of certain invariants defined for group actions and their analogues orbifolds. In particular, we prove that Fadell's equivariant category $G$-spaces coincides with the Lusternik-Schnirelmann orbifolds when is finite.

We describe a method for disambiguating Chinese commas that is central to Chinese sentence segmentation. Chinese sentence segmentation is viewed as the detection of loosely coordinated clauses separated by commas. Trained and tested on data derived from the Chinese Treebank, our model achieves a classification accuracy of close to 90% overall, which translates to an F1 score of 70% for detectin...

binding trees (abts) are a generalization of abstract syntax trees where operators may express variable binding structure as part of their arities. Originally formulated by Peter Aczel [1], unisorted abts have been deployed successfully as the uniform syntactic framework for several implementations of Constructive Type Theory, including Nuprl [3], MetaPRL [13] and JonPRL [21]. In Practical Foun...