A polynomial relational class of binary CSP - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Annals of Mathematics and Artificial Intelligence Année : 2018

A polynomial relational class of binary CSP

Résumé

Finding a solution to a constraint satisfaction problem (CSP) is known to be an NP-hard task. Considerable effort has been spent on identifying tractable classes of CSP,in other words, classes of constraint satisfaction problems for which there are polynomial time recognition and resolution algorithms. In this article, we present a relational tractable class of binary CSP. Our key contribution is a new ternary operation that we name mjx. We first characterize mjx-closed relations which leads to an optimal algorithm to recognize such relations. To reduce space and time complexity, we define a new storage technique for these relations which reduces the complexity of establishing a form of strong directional path consistency, the consistency level that solves all instances of the proposed class (and, indeed, of all relational classes closed under a majority polymorphism).
Fichier principal
Vignette du fichier
Jguirim_22115.pdf (401.22 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-02640862 , version 1 (28-05-2020)

Identifiants

Citer

Wafa Jguirim, Wady Naanaa, Martin Cooper. A polynomial relational class of binary CSP. Annals of Mathematics and Artificial Intelligence, 2018, 83 (1), pp.1-20. ⟨10.1007/s10472-017-9566-6⟩. ⟨hal-02640862⟩
17 Consultations
37 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More