Abstract
Some constraint languages are more powerful than others because they allow us to express a larger collection of problems. More generally, the finite constraint satisfaction problem (CSP) with arbitrary constraints (non-binary), is known to be NP-complete 9, whereas many families of restricted constraints have been identified like tracta ble subproblems [1][7]. We propose two preprocessing algorithms in order to study the consistency check (the consistency algorithm) when a new non-binary constraint is inserted into the system and to reduce the variable domains (the reduction algorithm) that participate in these non-binary disjunctive temporal constraints. Following, we can apply some of the techniques to solve this CSP. Thus, we can manage more complex and expressive constraints that many real problems must deal with.
Sign-in/Register to access full text options 
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.
