Preprocessing versus search processing for constraint satisfaction problems
| dc.contributor.author | Wallace, Richard J. | |
| dc.date.accessioned | 2017-05-25T11:00:19Z | |
| dc.date.available | 2017-05-25T11:00:19Z | |
| dc.date.issued | 2016-11 | |
| dc.date.updated | 2017-05-25T10:30:03Z | |
| dc.description.abstract | A perennial problem in hybrid backtrack CSP search is how much local consistency processing should be done to achieve the best efficiency. This can be divided into two separate questions: (1) how much work should be done before the actual search begins, i.e. during preprocessing? and (2) how much of the same processing should be interleaved with search? At present there are two leading approaches to establishing stronger consistencies than the basic arc consistency maintenance that is done in most solvers. On the one hand there are various kinds singleton arc consistency that can be used; on the other there are several variants of restricted path consistency. To date these have not been compared directly. The present work attempts to do this for a variety of problems, and in so doing, it also provides an empirical evaluation of the preprocessing versus search processing issue. Comparisons are made using the domain/degree and domain/weighted degree variable ordering heuristics. In general, it appears that preprocessing with higher levels of consistency followed by hybrid-AC processing (i.e. MAC) gives the best results, especially when the weighted degree heuristic is used. For problems with n-ary constraints, this difference seems to be even more pronounced. In some cases, higher levels of consistency maintenance established during preprocessing leads to performance gains over MAC of several orders of magnitude. | en |
| dc.description.status | Not peer reviewed | en |
| dc.description.uri | http://rcra.aixia.it/rcra2016 | en |
| dc.description.version | Published Version | en |
| dc.format.mimetype | application/pdf | en |
| dc.identifier.citation | Wallace, R. J. (2016) ‘Preprocessing versus search processing for constraint satisfaction problems’ (from the Proceedings of the 23rd RCRA International Workshop on Experimental Evaluation of Algorithms for Solving Problems with Combinatorial Explosion 2016 (RCRA 2016), Genova, Italy, 28 November 2016), CEUR Workshop Proceedings, 1745, pp. 89-103. | en |
| dc.identifier.endpage | 103 | en |
| dc.identifier.issn | 1613-0073 | |
| dc.identifier.journaltitle | CEUR Workshop Proceedings | en |
| dc.identifier.startpage | 89 | en |
| dc.identifier.uri | https://hdl.handle.net/10468/4023 | |
| dc.identifier.volume | 1745 | en |
| dc.language.iso | en | en |
| dc.publisher | Sun SITE Central Europe (CEUR) / RWTH Aachen University | en |
| dc.relation.ispartof | RCRA International Workshop on Experimental Evaluation of Algorithms for Solving Problems with Combinatorial Explosion 2016 (RCRA 2016) | |
| dc.relation.uri | http://ceur-ws.org/Vol-1745/paper7.pdf | |
| dc.rights | © 2016, Richard J. Wallace | en |
| dc.rights.uri | http://ceur-ws.org/ | en |
| dc.subject | Preprocessing | en |
| dc.subject | Search processing | en |
| dc.subject | Weighted degree | en |
| dc.title | Preprocessing versus search processing for constraint satisfaction problems | en |
| dc.type | Conference item | en |
