{"type":"ScholarlyArticle","title":"Merging Constraint Satisfaction Subproblems to Avoid Redundant Search","authors":[{"name":"Javier Larrosa","slug":"javier-larrosa","given":"Javier","family":"Larrosa","affiliation":""}],"abstract":"When solving a constraint satisfaction problem we may find similar subproblems. Algorithms not exploiting this similarity are condemned to duplicate some work. In this paper we introduce a technique for merging sibling subproblems which avoids redundancy in search associated to their similarity. We show that, whenforward checking is enhanced with this capability, its performance may be increased . Experimental results on hard crossword puzzles support the practical validity of our approach.","doi":null,"url":"https://ijcai.org/proceedings/1997/63","pdf":"https://ijcai.org/proceedings/1997/0063.pdf","markdown":"https://ijcai.org/proceedings/1997/63.md","bibtex":"https://ijcai.org/proceedings/1997/bibtex/63","volume":{"slug":"1997","title":"Proceedings of the Fifteenth International Joint Conference on Artificial Intelligence","short_title":"IJCAI 1997","url":"https://ijcai.org/proceedings/1997/","year":1997,"location":"Nagoya, Japan","dates":"","editors":"Martha E. Pollack","isbn":"","publisher":"International Joint Conferences on Artificial Intelligence","doi_prefix":""},"section":"Constraint Satisfaction","track":"Constraint Satisfaction","number":63,"pages":{"first":424,"last":432},"keywords":[],"videos":[],"references":[],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}