Abstract
Many backtrack search algorithms has been designed over the last years to solve constraint satisfaction problems. Among them, Forward Checking (FC) and Maintaining Arc Consistency (MAC) algorithms are the most popular and studied algorithms. In This work, such algorithms are revisited and extensively compared giving rise to interesting characterization of their efficiency with respect to random instances. More precisely, we provide experimental evidence that FC outperforms MAC on hard CSPs with high graph density and low constraint tightness whereas MAC is better on hard CSPs with low density and high constraints tightness. This results show that on some CSPs maintaining full arc consistency during search might be time consuming. Then, we propose a new generic approach that maintain partial and parameterizable form of local consistency.
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 callSimilar Papers
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.
