|
| | | | |
| | | |
| Stat |
Members: 3669
Articles: 2'599'751
Articles rated: 2609
13 March 2025 |
|
| | | | |
|
Article overview
| |
|
|
Weaker consistency notions for all the CSPs of bounded width | | Marcin Kozik
; | | Date: |
2 May 2016 | | Abstract: | The characterization of all the Constraint Satisfaction Problems of bounded
width, proposed by Feder and Vardi [SICOMP’98], was confirmed in [Bulatov’09]
and independently in [FOCS’09, JACM’14]. Both proofs are based on the
(2,3)-consistency (using Prague consistency in [FOCS’09], directly in
[Bulatov’09]) which is costly to verify.
We introduce a new consistency notion, Singleton Linear Arc Consistency
(SLAC), and show that it solves the same family of problems. SLAC is weaker
than Singleton Arc Consistency (SAC) and thus the result answers the question
from [JLC’13] by showing that SAC solves all the problems of bounded width. At
the same time the problem of verifying weaker consistency (even SAC) offers
significant computational advantages over the problem of verifying
(2,3)-consistency which improves the algorithms solving the CSPs of bounded
width. | | Source: | arXiv, 1605.0565 | | Services: | Forum | Review | PDF | Favorites | |
|
|
No review found.
Did you like this article?
Note: answers to reviews or questions about the article must be posted in the forum section.
Authors are not allowed to review their own article. They can use the forum section.
|
| |
|
|
|
REGISTER