2009 21st IEEE International Conference on Tools with Artificial Intelligence 2-C3OP: An Improved Version of 2-Consistency Newark, New Jersey November 02-November 04 ISBN: 978-0-7695-3920-1
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/ICTAI.2009.54
Nowadays, many real problems can be modeled as constraint satisfaction problems. Arc consistency algorithms are widely used to prune the search space of Constraint Satisfaction. In this paper we present a new algorithm, called 2-C3OP, that achieves 2-consistency in binary and non-normalized CSPs. This algorithm is a reformulation of 2-C3 algorithm and it performs the constraint checks bidirectionally using inference. The evaluation section shows that 2-C3OP achieve 2-consistency like 2-C3 and it is 40% faster. Furthermore, 2-C3OP performs less number of constraint checks than both AC3 and 2-C3.
Index Terms:
Constraint Programming, filtering techniques
Citation:
Marlene Arangú, Miguel A. Salido, Federico Barber, "2-C3OP: An Improved Version of 2-Consistency," ictai, pp.344-348, 2009 21st IEEE International Conference on Tools with Artificial Intelligence, 2009 Usage of this product signifies your acceptance of the Terms of Use. | |||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb