Abstract
Constraints allow the declarative specification of various problems in many fields. In particular, constraint hierarchies that enable soft constraints with hierarchical preferences are useful for programming interactive graphical applications. However, it is still difficult to handle constraint hierarchies with nonlinear constraints. This paper proposes an algorithm for solving constraint hierarchies possibly with nonlinear constraints. Instead of directly solving a constraint hierarchy, it successively generates and solves ordinary constraint problems by using an external SMT solver. The results of our experiments show that the algorithm is able to find accurate constraint hierarchy solutions.
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.
