Skip to Main content Skip to Navigation
Conference papers

Improving GAC-4 for Table and MDD Constraints

Guillaume Perez 1, * Jean-Charles Régin 1
* Corresponding author
1 Laboratoire d'Informatique, Signaux, et Systèmes de Sophia-Antipolis (I3S) / Equipe CEP
Laboratoire I3S - MDSC - Modèles Discrets pour les Systèmes Complexes
Abstract : We introduce GAC-4R, MDD-4, and MDD-4R three new algorithms for maintaining arc consistency for table and MDD constraints. GAC-4R improves the well-known GAC-4 algorithm by managing the internal data structures in a different way. Instead of maintaining the internal data structures only by studying the consequences of deletions, we propose to reset the data structures by recomputing them from scratch whenever it saves time. This idea avoids the major drawback of the GAC-4 algorithm, i.e., its cost at a shallow search-tree depth. We also show that this idea can be exploited in MDD constraints. Experiments show that GAC-4R is competitive with the best arc-consistency algorithms for table constraints, and that MDD-4R clearly outperforms all classical algorithms for table or MDD constraints.
Complete list of metadatas

Cited literature [21 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-01344079
Contributor : Jean-Charles Regin <>
Submitted on : Monday, July 11, 2016 - 12:28:27 PM
Last modification on : Thursday, March 5, 2020 - 12:20:24 PM
Document(s) archivé(s) le : Wednesday, October 12, 2016 - 12:17:33 PM

File

ac4mdd.pdf
Files produced by the author(s)

Identifiers

Collections

Citation

Guillaume Perez, Jean-Charles Régin. Improving GAC-4 for Table and MDD Constraints. CP 2014, Sep 2014, Lyon, France. ⟨10.1007/978-3-319-10428-7_44⟩. ⟨hal-01344079⟩

Share

Metrics

Record views

156

Files downloads

347