Abstract
In order to improve constraint satisfaction techniques, a promising way is to use special features of constraints and variable domains. This paper examines a special class of CSPs (Constraint Satisfaction Problems) in which a partial order is defined on each domain and the constraints are compatible with these orders. A special arc-consistency algorithm for this case is presented and some questions about finding all solutions are discussed. The presented ideas can be used in constraint systems implemented in an object-oriented language, where inheritance hierarchy of objects is a natural support for the presented CSP type.
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 callMore From: International Journal on Artificial Intelligence Tools
Disclaimer: 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.
