|Subject:||Re: Incomplete lists in Prolog|
|Date:||Thu, 07 May 2009 09:46:51 +0200|
|User-agent:||Thunderbird 22.214.171.124 (Macintosh/20090302)|
This is not a real answer, but a remark.
The question was addressed in PrologIII with constraints overs the lists (and hence over the strings).
An exemple is (so called Marseille syntax)
Z :: 10, <1,2,3>.Z = Z.<2,3,1>
i.e : the list Z is of the length 10 and,
the equation (constraint) to be satisfied is such that :
<1,2,3>.Z : the list containing <1,2,3> put before Z in a list must be equal to
Z.<2,3,1> : the same Z put before the list <2,3,1>
=> a solution is Z=<1,2,3,1,2,3,1,2,3,1>
May be the key feature here is the notion of concatenation (append) instead of the "cons" constructor used in Prolog std (inherited from Lisp).
But as I know, PrologIII contains a special solver over what is called the monoide space (actually a solver over finite trees). Many research works was done on the "associative unification" with linguistic applications.
I guess : adding that feature to Gprolog would be a big task.
Jasper Taylor a écrit :
-- Alexandre Saidi Maitre de Conférences Ecole Centrale de Lyon-Dép. MI Tél : 0472186530, Fax : 0472186443
|[Prev in Thread]||Current Thread||[Next in Thread]|