Dynamic virtual arc consistency

Authors:
Hiep Nguyen;Thomas Schiex;Christian Bessiere
Affiliations:
Unité de Biométrie et Intelligence Artificielle, INRA, Toulouse, France;Unité de Biométrie et Intelligence Artificielle, INRA, Toulouse, France;University of Montpellier, Montpellier, France
Venue:
Proceedings of the 28th Annual ACM Symposium on Applied Computing
Year:
2013

Citing 8
Cited 0

Radio Link Frequency Assignment

Constraints
Arc consistency for soft constraints

Artificial Intelligence
Virtual Arc consistency for weighted CSP

AAAI'08 Proceedings of the 23rd national conference on Artificial intelligence - Volume 1
Valued constraint satisfaction problems: hard and easy problems

IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 1
Existential arc consistency: getting closer to full arc consistency in weighted CSPs

IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
Russian Doll search with tree decomposition

IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
Soft arc consistency revisited

Artificial Intelligence
Arc-consistency in dynamic constraint satisfaction problems

AAAI'91 Proceedings of the ninth National conference on Artificial intelligence - Volume 1

Quantified Score

Hi-index	0.00

Visualization

Abstract

Virtual Arc Consistency (VAC) is a recent local consistency for processing Cost Function Networks (or Weighted Constraint Networks) that exploits a simple but powerful connection with classical Constraint Networks. It has allowed to close hard frequency assignment benchmarks and is capable of directly solving networks of submodular functions. The algorithm enforcing VAC is an iterative algorithm that solves a sequence of classical Constraint Networks. In this work, we show that Dynamic Arc Consistency algorithms can be suitably injected in the virtual arc consistency iterative algorithm, providing noticeable speedups.