{"type":"ScholarlyArticle","title":"Look-Ahead Value Ordering for Constraint Satisfaction Problems","authors":[{"name":"Daniel Frost","slug":"daniel-frost","given":"Daniel","family":"Frost","affiliation":""},{"name":"Rina Dechter","slug":"rina-dechter","given":"Rina","family":"Dechter","affiliation":""}],"abstract":"Looking ahead during search is often useful when solving constraint satisfaction problems. Previous studies have shown that looking ahead helps by causing dead-ends to occur earlier in the search, and by providing information that is useful for dynamic variable ordering. In this paper, we show that another benefit of lo?king ahead is a useful domain value ordermg heuristic, which we call look-ahead value ordering or LVO. LVO counts the number of times each value of the current variable conflicts with some value of a future variable, and the value with the lowest number of conflicts is chosen first. Our experiments show that look-ahead value ordering can be of substantial benefit, especially on hard constraint satisfaction problems.","doi":null,"url":"https://ijcai.org/proceedings/1995/75","pdf":"https://ijcai.org/proceedings/1995/0075.pdf","markdown":"https://ijcai.org/proceedings/1995/75.md","bibtex":"https://ijcai.org/proceedings/1995/bibtex/75","volume":{"slug":"1995","title":"Proceedings of the Fourteenth International Joint Conference on Artificial Intelligence","short_title":"IJCAI 1995","url":"https://ijcai.org/proceedings/1995/","year":1995,"location":"Montréal, Québec, Canada","dates":"","editors":"Chris S. Mellish","isbn":"","publisher":"International Joint Conferences on Artificial Intelligence","doi_prefix":""},"section":"Constraint Satisfaction","track":"Constraint Satisfaction","number":75,"pages":{"first":572,"last":577},"keywords":[],"videos":[],"references":[],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}