Arc Consistency in the Dual Encoding of Non-Binary CSPs

Abstract

A non-binary Constraint Satisfaction Problem (CSP) can be solved by converting the problem into an equivalent binary one and applying well-established binary CSP techniques. An alternative way is to use extended versions of binary techniques directly in the non-binary problem. There are two well-known methods in the literature for translating a non-binary… (More)

Topics

9 Figures and Tables

Cite this paper

@inproceedings{Karagiannis2012ArcCI, title={Arc Consistency in the Dual Encoding of Non-Binary CSPs}, author={Panagiotis Karagiannis and Nikos Samaras and Kostas Stergiou}, year={2012} }