{"type":"ScholarlyArticle","title":"A New Method for Solving Constraint Satisfaction Problems","authors":[{"name":"Raimund Seidel","slug":"raimund-seidel","given":"Raimund","family":"Seidel","affiliation":""}],"abstract":"This paper deals with the combinatorial search problem of finding values for a set of variables subject to a set of constraints. This problem is referred to as a constraint satisfaction problem. We present an algorithm for finding all the solutions of a constraint satisfaction problem with worst case time bound O(m*kf+l) and space bound O(n*kf+1 ), where n is the number of variables in the problem, m the number of constraints, k the cardinality of the domain of the variables, and f <n an integer depending only on a graph which is associated with the problem. It will be shown that for planar graphs and graphs of fixed genus this f is O( / nJ.","doi":null,"url":"https://ijcai.org/proceedings/1981/66","pdf":"https://ijcai.org/proceedings/1981/0066.pdf","markdown":"https://ijcai.org/proceedings/1981/66.md","bibtex":"https://ijcai.org/proceedings/1981/bibtex/66","volume":{"slug":"1981","title":"Proceedings of the Seventh International Joint Conference on Artificial Intelligence","short_title":"IJCAI 1981","url":"https://ijcai.org/proceedings/1981/","year":1981,"location":"Vancouver, British Columbia, Canada","dates":"24-28 August 1981","editors":"Roger C. Schank","isbn":"","publisher":"International Joint Conferences on Artificial Intelligence","doi_prefix":""},"section":"INFERENCE and REASONING","track":"INFERENCE and REASONING","number":66,"pages":{"first":338,"last":341},"keywords":[],"videos":[],"references":[],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}