{"type":"ScholarlyArticle","title":"Extracting Constraint Satisfaction Subproblems","authors":[{"name":"Eugene C. Freuder","slug":"eugene-c-freuder","given":"Eugene C.","family":"Freuder","affiliation":""},{"name":"Paul D. Hubbe","slug":"paul-d-hubbe","given":"Paul D.","family":"Hubbe","affiliation":""}],"abstract":"Given a subproblem, S, of a constraint satisfaction problem, we can decompose the problem into a set of disjoint subproblems one of which will be S. This decomposition permits exploitation of problem-specific metaknowledge, a priori or acquired knowledge, about S. If we know that S is unsolvable, for example, the decomposition permits us to extract and then discard S, restricting the search for a solution to the remaining subproblems. A variety of potential uses for the decomposition method are discussed. A specific method that dynamically discards failed subproblems during forward checking search is described, and its utility demonstrated experimentally.","doi":null,"url":"https://ijcai.org/proceedings/1995/72","pdf":"https://ijcai.org/proceedings/1995/0072.pdf","markdown":"https://ijcai.org/proceedings/1995/72.md","bibtex":"https://ijcai.org/proceedings/1995/bibtex/72","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":72,"pages":{"first":548,"last":556},"keywords":[],"videos":[],"references":[],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}