{"type":"ScholarlyArticle","title":"A Maximal Tractable Class of Soft Constraints","authors":[{"name":"David A. Cohen","slug":"david-a-cohen","given":"David A.","family":"Cohen","affiliation":""},{"name":"Martin C. Cooper","slug":"martin-c-cooper","given":"Martin C.","family":"Cooper","affiliation":""},{"name":"Peter Jeavons","slug":"peter-jeavons","given":"Peter","family":"Jeavons","affiliation":""},{"name":"Andrei A. Krokhin","slug":"andrei-a-krokhin","given":"Andrei A.","family":"Krokhin","affiliation":""}],"abstract":"Many optimization problems can be expressed using some form of soft constraints, where different measures of desirability are associated with different combinations of domain values for specified subsets of variables. In this paper we identify a class of soft binary constraints for which the problem of finding the optimal solution is tractable. In other words, we show that for any given set of such constraints, there exists a polynomial time algorithm to determine the assignment having the best overall combined measure of desirability. This tractable class includes many commonly-occurring soft constraints, such as \"as near as possible\" or \"as soon as possible after\", as well as crisp constraints such as \"greater than\".","doi":null,"url":"https://ijcai.org/proceedings/2003/30","pdf":"https://ijcai.org/proceedings/2003/0030.pdf","markdown":"https://ijcai.org/proceedings/2003/30.md","bibtex":"https://ijcai.org/proceedings/2003/bibtex/30","volume":{"slug":"2003","title":"Proceedings of the Eighteenth International Joint Conference on Artificial Intelligence","short_title":"IJCAI 2003","url":"https://ijcai.org/proceedings/2003/","year":2003,"location":"Acapulco, Mexico","dates":"","editors":"Georg Gottlob","isbn":"","publisher":"International Joint Conferences on Artificial Intelligence","doi_prefix":""},"section":null,"track":"","number":30,"pages":{"first":209,"last":213},"keywords":[],"videos":[],"references":[],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}