{"type":"ScholarlyArticle","title":"Cooperative Search and Nogood Recording","authors":[{"name":"Cyril Terrioux","slug":"cyril-terrioux","given":"Cyril","family":"Terrioux","affiliation":""}],"abstract":"Within the framework of constraint satisfaction problem, we propose a new scheme of cooperative parallel search. The cooperation is realized by exchanging nogoods (instantiations which can’t be extended to a solution). We associate a process with each solver and we introduce a manager of nogoods, in order to regulate exchanges of nogoods. Each solver runs the algorithm Forward-Checking with Nogood Recording. We add to algorithm a phase of interpretation, which limits the size of the search tree according to the received nogoods. Solvers differ from each other in ordering variables and/or values by using different heuristics. The interest of our approach is shown experimentally. In particular, we obtain linear or superlinear speed-up for consistent problems, like for inconsistent ones, up to about ten solvers.","doi":null,"url":"https://ijcai.org/proceedings/2001/37","pdf":"https://ijcai.org/proceedings/2001/0037.pdf","markdown":"https://ijcai.org/proceedings/2001/37.md","bibtex":"https://ijcai.org/proceedings/2001/bibtex/37","volume":{"slug":"2001","title":"Proceedings of the Seventeenth International Joint Conference on Artificial Intelligence","short_title":"IJCAI 2001","url":"https://ijcai.org/proceedings/2001/","year":2001,"location":"Seattle, Washington, USA","dates":"","editors":"","isbn":"","publisher":"International Joint Conferences on Artificial Intelligence","doi_prefix":""},"section":null,"track":"","number":37,"pages":{"first":260,"last":264},"keywords":[],"videos":[],"references":[],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}