Abstract
Dealing with non-linear constraints over real numbers is one of the most important and non-trivial problems in constraint logic programming. We report our initial effort in tackling the problem with two methods developed in computer algebra during last three decades: Partial Cylindrical Algebraic Decomposition and Grobner basis. We have implemented a prototype called RISC-CLP(Real). Experience with the prototype suggests that it is desirable and in fact feasible to provide a full support of non-linear constraints.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
