Journal article icon

Journal article

On singleton arc consistency for CSPs defined by monotone patterns

Abstract:
Singleton arc consistency is an important type of local consistency which has been recently shown to solve all constraint satisfaction problems (CSPs) over constraint languages of bounded width. We aim to characterise all classes of CSPs defined by a forbidden pattern that are solved by singleton arc consistency and closed under removing constraints. We identify five new patterns whose absence ensures solvability by singleton arc consistency, four of which are provably maximal and three of which generalise 2-SAT. Combined with simple counter-examples for other patterns, we make significant progress towards a complete classification.
Publication status:
Published
Peer review status:
Peer reviewed

Actions


Access Document


Publisher copy:
10.1007/s00453-018-0498-2

Authors


More by this author
Institution:
University of Oxford
Division:
MPLS Division
Department:
Computer Science
Role:
Author
More by this author
Institution:
University of Oxford
Division:
MPLS
Department:
Computer Science
Role:
Author


More from this funder
Funding agency for:
Zivny, S
Grant:
University Research Fellowship UF120013
More from this funder
Grant:
ANR-11-LABX-0040-CIMI within the program ANR-11-IDEX-0002-02


Publisher:
Springer US
Journal:
Algorithmica More from this journal
Volume:
81
Issue:
4
Pages:
1699–1727
Publication date:
2018-08-13
Acceptance date:
2018-08-02
DOI:
EISSN:
1432-0541
ISSN:
0178-4617


Keywords:
Pubs id:
pubs:892209
UUID:
uuid:14d312ed-e35b-4e10-8c55-068b750604dd
Local pid:
pubs:892209
Source identifiers:
892209
Deposit date:
2018-08-02

Terms of use



Views and Downloads






If you are the owner of this record, you can report an update to it here: Report update to this record

TO TOP