Groups | Search | Server Info | Keyboard shortcuts | Login | Register [http] [https] [nntp] [nntps]
Groups > comp.programming > #16945
| From | Julio Di Egidio <julio@diegidio.name> |
|---|---|
| Newsgroups | comp.lang.prolog, comp.programming |
| Subject | Re: Stronger CLP/FD sum consistency? (SWI-Prolog) |
| Date | 2026-10-24 15:10 +0200 |
| Organization | A noiseless patient Spider |
| Message-ID | <11biao4$2jpln$3@dont-email.me> (permalink) |
| References | <11bi62j$2jpln$1@dont-email.me> |
Cross-posted to 2 groups.
On 24/10/2026 13:50, Julio Di Egidio wrote: [amended] > BTW, CLP/B does offer that stronger consistency, i.e. it > does solve A and B in the example, but then CLP/B does not > offer (that I can see) a sum constraint proper, card/2 is > an expression that wants ground cardinalities: So that e.g. we cannot generically say that two sets have the same cardinality. -Julio
Back to comp.programming | Previous | Next — Previous in thread | Find similar | Unroll thread
Stronger CLP/FD sum consistency? (SWI-Prolog) Julio Di Egidio <julio@diegidio.name> - 2026-10-24 13:50 +0200 Re: Stronger CLP/FD sum consistency? (SWI-Prolog) Julio Di Egidio <julio@diegidio.name> - 2026-10-24 13:57 +0200 Re: Stronger CLP/FD sum consistency? (SWI-Prolog) Julio Di Egidio <julio@diegidio.name> - 2026-10-24 15:10 +0200
csiph-web