{"type":"ScholarlyArticle","title":"Diagnosing and Solving Over-Determined Constraint Satisfaction Problems","authors":[{"name":"R. R. Bakker","slug":"r-r-bakker","given":"R. R.","family":"Bakker","affiliation":""},{"name":"F. Dikker","slug":"f-dikker","given":"F.","family":"Dikker","affiliation":""},{"name":"F. Tempelman","slug":"f-tempelman","given":"F.","family":"Tempelman","affiliation":""},{"name":"P. M. Wognum","slug":"p-m-wognum","given":"P. M.","family":"Wognum","affiliation":""}],"abstract":"Constraint relaxation is a frequently used technique for managing over-determined constraint satisfaction problems. A problem in constraint relaxation is the selection of the appropriate constraints. We show that methods developed in model-based diagnosis solve this problem. The resulting method, DOC, an abbreviation for Diagnosis of Over-determined Constraint Satisfaction Problems, identifies the set of least important constraints that should be relaxed to solve the remaining constraint satisfaction problem. If the solution is not acceptable for a user, DOC selects next-best sets of least-important constraints until an acceptable solution has been generated. The power of DOC is illustrated by a case study of scheduling the Dutch major league soccer competition. The current schedule is made using human insight and Operations Research methods. Using DOC, the 1992-1993 schedule has been improved by reducing the number and importance of the violated constraints by 56%. · The case study revealed that efficiency improvement is a major issue in order to apply this method to large-scale over-determined scheduling and constraint satisfaction problems.","doi":null,"url":"https://ijcai.org/proceedings/1993/39","pdf":"https://ijcai.org/proceedings/1993/0039.pdf","markdown":"https://ijcai.org/proceedings/1993/39.md","bibtex":"https://ijcai.org/proceedings/1993/bibtex/39","volume":{"slug":"1993","title":"Proceedings of the Thirteenth International Joint Conference on Artificial Intelligence","short_title":"IJCAI 1993","url":"https://ijcai.org/proceedings/1993/","year":1993,"location":"Chambéry, France","dates":"","editors":"Ruzena Bajcsy","isbn":"","publisher":"International Joint Conferences on Artificial Intelligence","doi_prefix":""},"section":"Constraint Satisfaction Problems","track":"Constraint Satisfaction Problems","number":39,"pages":{"first":276,"last":280},"keywords":[],"videos":[],"references":[],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}