Strengthening Neighbourhood Substitution - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2020

Strengthening Neighbourhood Substitution

Résumé

Domain reduction is an essential tool for solving the con-straint satisfaction problem (CSP). In the binary CSP, neighbourhoodsubstitution consists in eliminating a value if there exists another valuewhich can be substituted for it in each constraint. We show that the no-tion of neighbourhood substitution can be strengthened in two distinctways without increasing time complexity. We also show the theoreticalresult that, unlike neighbourhood substitution, finding anoptimal se-quence of these new operations is NP-hard.

Dates et versions

hal-02950838 , version 1 (28-09-2020)

Identifiants

Citer

Martin Cooper. Strengthening Neighbourhood Substitution. International Conference on Principles and Practice of Constraint Programming 2020, 2020, Louvain, Belgium. pp.126-142, ⟨10.1007/978-3-030-58475-7_8⟩. ⟨hal-02950838⟩
41 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More