> > Ok... so this implies some kind of ordering constraint on the use of > non-commutative relationships. > > I am going to guess that this constraint has something to do with the > ordering of your D -- for example that lower-valued row indexes into D > must always appear on the left side of the comparative relationship > and higher-valued row indexes into D must always appear on the right > side of the comparative relationship? > > Does this sound right? >
Yes, I was about to suggest this approach if you want to have a single constraint (no transpose). Ofcourse, now you have the overhead of needing to switch arguments if they are out of order. You may also want to take a look at a traditional arc consistency algorithm: http://en.wikipedia.org/wiki/AC-3_algorithm Cheers, Mike ---------------------------------------------------------------------- For information about J forums see http://www.jsoftware.com/forums.htm
