Accéder directement au contenu Accéder directement à la navigation
Communication dans un congrès

Detecting and Exploiting Subproblem Tractability

Abstract : Constraint satisfaction problems may be nearly tractable. For instance, most of the relations in a problem might belong to a tractable language. We introduce a method to take advantage of this fact by computing a backdoor to this tractable language. The method can be applied to many tractable classes for which the membership test is itself tractable. We introduce therefore two polynomial membership testing algorithms, to check if a language is closed under a majority or conservative Mal'tsev polymorphism, respectively. Then we show that computing a minimal backdoor for such classes is fixed parameter tractable (FPT) if the tractable subset of relations is given, and W[2]- complete otherwise. Finally, we report experimental results on the XCSP benchmark set. We identi- fied a few promising problem classes where prob- lems were nearly closed under a majority polymorphism and small backdoors could be computed.
Type de document :
Communication dans un congrès
Liste complète des métadonnées

Littérature citée [11 références]  Voir  Masquer  Télécharger

https://hal-lirmm.ccsd.cnrs.fr/lirmm-00830330
Déposant : Joël Quinqueton <>
Soumis le : mardi 4 juin 2013 - 16:58:40
Dernière modification le : mercredi 14 octobre 2020 - 04:21:34
Archivage à long terme le : : mardi 4 avril 2017 - 16:52:28

Fichier

ijcai13-tractability.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

  • HAL Id : lirmm-00830330, version 1
  • IRSTEA : 263216

Citation

Christian Bessière, Clément Carbonnel, Emmanuel Hébrard, George Katsirelos, Toby Walsh. Detecting and Exploiting Subproblem Tractability. IJCAI: International Joint Conference on Artificial Intelligence, Aug 2013, Beijing, China. pp.468-474. ⟨lirmm-00830330⟩

Partager

Métriques

Consultations de la notice

506

Téléchargements de fichiers

635