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.
Document type :
Conference papers
Complete list of metadatas

Cited literature [11 references]  Display  Hide  Download

https://hal-lirmm.ccsd.cnrs.fr/lirmm-00830330
Contributor : Joël Quinqueton <>
Submitted on : Tuesday, June 4, 2013 - 4:58:40 PM
Last modification on : Friday, January 10, 2020 - 9:10:08 PM
Long-term archiving on: Tuesday, April 4, 2017 - 4:52:28 PM

File

ijcai13-tractability.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : lirmm-00830330, version 1

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⟩

Share

Metrics

Record views

477

Files downloads

584