C.K. Chiu and J.H.M. Lee. Efficient interval linear equality solving in constraint logic programming.  Home/Search   Document Details and Download   Summary   Related Articles

.... X2 (1 X2) X3 (1 X3) 0, solve( X1,X2,X3,X4] fail ; true) Solution: X1 = 0.47742930 . 0.47742928) X2 = 0.47744253 . 0.47744251) X3 = 0.52090789 . 0.52090787) X4 = 0.52090789 . 0.52090787) 2.1. 5 Handling opened intervals Many systems such as Newton [5, 22] CIAL [9], do not support opened ranges for the variable domains. On the other hand, a well defined language such as Prolog IV supports opened as well as closed domains. It is often claimed by those who do not so that bracket handling is not very useful and slows down the computation. Nevertheless, it is ....

....benchmarks. In the future, we plan to add constraint dynamic generation in order to be able to support conditioning and computer algebra methods such as Grobner bases [4] We plan also to handle linear constraints with specific algorithms to bypass the inefficiency of interval narrowing over them [9]. Declic is intended to be freely available by september 1997 under the same policy as clp(FD) at the address http: www.univ orleans.fr SCIENCES LIFO Members lg Declic. ....

C.K. Chiu and J.H.M. Lee. Efficient interval linear equality solving in constraint logic programming.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC