2008/10/12 Wit Jakuczun <wit.jakuczun_at_...6...>: > 2008/10/12 Ulrich Scholz <Ulrich.Scholz_at_...10...>: >> Consider the three clauses below. All require a non-empty set to have an >> empty intersection with itself, thus they all should fail. >> >> t1 does not fail but yields delayed goals. So to detect the inconsistency, >> we have to search for a solution. >> > t1 does not fail because constraint: > C #>= 1 > does not change lower bound for variable T. It is still equal to [] and > [] disjoint [] holds. > >> Is there a set constraint solver that allows to find such inconsistencies >> symbolically, i.e., without searching for an actual solution? >> > Do it yourself ;) : > You can do this by using membership_booleans predicate and > imposing that sum of those variables must be greater by 1. > No it does not speed up anything. Sorry for posting this suggestion too fast. Best regards. -- [ Wit Jakuczun w.jakuczun_at_...116... ] [ WLOG Solutions http://wlogsolutions.com ]Received on Sun Oct 12 2008 - 13:11:53 CEST
This archive was generated by hypermail 2.3.0 : Tue Apr 16 2024 - 09:13:20 CEST