Existential arc consistency: getting closer to full arc consistency in weighted CSPs

摘要: The weighted CSP framework is a soft constraint with wide range of applications. Most current state-of-the-art complete solvers can be described as basic depth-first branch and bound search that maintain some form arc consistency during the search. In this paper we introduce new stronger consistency, call existential directional provide an algorithm to enforce it. efficiency empirically demonstrated in variety domains.