Maintaining Virtual Arc Consistency Dynamically during Search

Abstract : Virtual Arc Consistency (VAC) is a recent local consistency for processing cost function networks (aka weighted constraint networks) that exploits a simple but powerful connection with standard 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 standard constraint networks. This algorithm has been improved by exploiting the idea of dynamic arc consistency between each iteration, leading to the dynamic VAC algorithm. When VAC is maintained during search, the difference between two adjacent nodes in the search tree is also limited. In this paper, we show that the incrementality of Dynamic VAC can also be useful when maintaining VAC during search and we present results showing that maintaining dynamic VAC during search can effectively accelerate search.
Document type :
Conference papers
Complete list of metadatas

Cited literature [18 references]  Display  Hide  Download

https://hal-lirmm.ccsd.cnrs.fr/lirmm-01228369
Contributor : Joël Quinqueton <>
Submitted on : Friday, November 13, 2015 - 8:57:19 AM
Last modification on : Wednesday, June 26, 2019 - 2:11:54 PM
Long-term archiving on: Friday, April 28, 2017 - 4:54:00 AM

File

Hiep14.pdf
Files produced by the author(s)

Identifiers

Collections

Citation

Hiep Nguyen, Simon de Givry, Thomas Schiex, Christian Bessière. Maintaining Virtual Arc Consistency Dynamically during Search. ICTAI: International Conference on Tools with Artificial Intelligence, Nov 2014, Limassol, Cyprus. pp.8-15, ⟨10.1109/ICTAI.2014.13⟩. ⟨lirmm-01228369⟩

Share

Metrics

Record views

380

Files downloads

320