No, I need non-linear constraints to solve also. GLPK seems target the linear programming as the name implies. My main idea is to solve constraints, wich are expressed not only by algebral operations on variables, but also by praedicates and logical connectiveness. You can see implication "=>" in the example, but I need and, or, xor, <=, <=>, compound data types of constraint variables such as lists, arrays, maps, dictionaries, and operations on that types in the constraints specification. Prolog is an attempt to solve such problems, but many tested by me implementations of Prolog (Chao, GNU, YAP, B) freezes on simple recursive queries or their stack overflows. In the complex program recursive definitions will occure and Prolog will fail. Consequantly, Prolog is inappropriate for my needs. This is the reason I downloaded Mozart-Oz to study and subscribed to the mozart-users list. In parallel I study Mercury interpreter comparing to Mozart-Oz.
2009/8/18 David Bremner <[email protected]> > Dmitry Negius wrote: > > >For my AI project I need to solve constraints like this: > A>255 => B. > >not B. > >?- A<1000. > > Maybe you would be happier with a mixed integer programming > environment (glpk is one free one; coin-or offers several > possibilities). You constraints can be modelled directly as a (mixed) > integer program. > > David > > > _________________________________________________________________________________ > mozart-users mailing list > [email protected] > http://www.mozart-oz.org/mailman/listinfo/mozart-users > -- Normal people grows o...@#
_________________________________________________________________________________ mozart-users mailing list [email protected] http://www.mozart-oz.org/mailman/listinfo/mozart-users
