Re: multiset ordering
- From: Giovanni Gherdovich <gherdovich@xxxxxxxxxxxxxxxxxxxxxx>
- Date: Tue, 17 Jul 2007 08:21:07 -0000
Dear Pierpaolo,
Thankyou for your quick reply.
What should the goal gt_ms_onestep([3],X) bind X to? What does happen instead?
How many and what kind of solutions has the goal permutation(X,Y) ?
Do you think that the goal 3 > T will generate good values for T?
(it doesn't, it generates the error you get, instead).
I see that my code behaves quite different from what I expected.
I thought that every predicate I wrote was invertible in
every parameter, but as you pointed out this is not the case.
Is there a way to write predicates such that every variable
can be uninstantiated when you submit a query to Prolog?
I don't know, some design-rule to follow...
Anyway, I'm reading the book "Programming in Prolog" by
Clocksin and Mellish,
http://www.amazon.co.uk/exec/obidos/ASIN/3540583505/bindingtimeli-21
and I hope that at the end of my reading I will have more clear ideas.
Ciao,
GG
.
- Follow-Ups:
- Re: multiset ordering
- From: Steffen Schwigon
- Re: multiset ordering
- From: Pierpaolo BERNARDI
- Re: multiset ordering
- References:
- multiset ordering
- From: Giovanni Gherdovich
- Re: multiset ordering
- From: Pierpaolo BERNARDI
- multiset ordering
- Prev by Date: Re: Question from a Prolog dummy
- Next by Date: Re: multiset ordering
- Previous by thread: Re: multiset ordering
- Next by thread: Re: multiset ordering
- Index(es):
Relevant Pages
|
|