Arc consistency for factorable relations

Abstract

An optimal arc consistency algorithm AC-4 was given by Mohr and Henderson [8]. AC-4 has cost 0(ea 2 ), and cost (na 2 ) for scene labelling. Although their algorithm is indeed optimal, under certain conditions a constraint satisfaction problem can be transformed into a less complex problem. In this paper, we present conditions and mechanisms for such transformations, and show how to factor relations into more manageable components. We describe how factorization can reduce AC-4's cost to O(ea), and apply this result to RETE match. Further, with our factorization, the cost of scene labelling is reduced to O(na).CR Classification E.

Distributed constraint optimization, resource allocation and scheduling in large scale agent networks

“…In addition, research efforts on algorithms that try to impose arc-consistency, have over the years proposed numerous alternatives. Between those algorithms, worth mentioning are: AC5 (Perlin, 1992), AC6 (Bessière and Cordier, 1993), AC7 (Bessière et al, 1999) and AC8 (Chmeiss and Jégou, 1998).…”