Thi-Bich-Hanh Dao

Learn More
We present in this paper an algorithm, in the theory T of (eventually infinite) trees, for solving constraints represented by full first order formulae, with equality as the only relation and with symbols of function taken in an infinite set F. The algorithm consists of a set of 11 rewrite rules. It transforms a first order formula in a conjunction of "(More)
Although the observation of grammaticality judgements is well acknowledged, their formal representation faces problems of different kinds: linguistic, psycholinguistic, logical, computational. In this paper we focus on addressing some of the logical and computational aspects, relegating the linguistic and psycholinguistic ones in the parameter space. We(More)
In this paper, we present an abstract framework for learning a finite domain constraint solver mod-eled by a set of operators enforcing a consistency. The behavior of the consistency to be learned is taken as the set of examples on which the learning process is applied. The best possible expression of this operator in a given language is then searched. We(More)
In recent years, clustering has been extended to constrained clustering, so as to integrate knowledge on objects or on clusters, but adding such constraints generally requires to develop new algorithms. We propose a declarative and generic framework, based on Constraint Programming, which enables to design clustering tasks by specifying an optimization(More)
Considering an initial set of terms E, a rewriting relation R and a goal set of terms Bad, reachability analysis in term rewriting tries to answer to the following question: does there exists at least one term of Bad that can be reached from E using the rewriting relation R? Some of the approaches try to show that there exists at least one term of Bad(More)
We present in this paper an algorithm in the theory <i>T</i> of possibly infinite trees for solving general constraints represented by full first-order formulas, with equality as the only relation and functional symbols taken from an infinite set <b>F</b>. The algorithm consists of a set of 11 rewriting rules. It transforms a first-order formula <i>p</i> in(More)
We present in this paper a first-order axiomatization of an extended theory T of finite or infinite trees, built on a signature containing an infinite set of function symbols and a relation finite(t) which enables to distinguish between finite or infinite trees. We show that T has at least one model and prove its completeness by giving not only a decision(More)