Journal article
The power of arc consistency for CSPs defined by partially-ordered forbidden patterns
- Abstract:
-
Characterising tractable fragments of the constraint satisfaction problem (CSP) is an important challenge in theoretical computer science and artificial intelligence. Forbid- ding patterns (generic sub-instances) provides a means of defining CSP fragments which are neither exclusively language-based nor exclusively structure-based. It is known that the class of binary CSP instances in which the broken-triangle pattern (BTP) does not occur, a class which includes all tree-structured instances,...
Expand abstract
- Publication status:
- Published
- Peer review status:
- Peer reviewed
Actions
Access Document
- Files:
-
-
(Version of record, pdf, 492.6KB)
-
- Publisher copy:
- 10.23638/LMCS-13(4:26)2017
Why is the content I wish to access not available via ORA?
Bibliographic data (the information relating to research outputs) and full-text items (e.g. articles, theses, reports, etc.) arrive in ORA from several different sources. Unfortunately we are not able to make available the full-text for every research output.
Please contact the ORA team (
) if you have queries regarding unavailable content OR if you are aware of a full-text copy we can make available.
) if you have queries regarding unavailable content OR if you are aware of a full-text copy we can make available.
Content may be unavailable for the following four reasons
-
Version unsuitable
-
We have not obtained a suitable full-text for a given research output. See this page for more information.
-
Recently completed
-
Sometimes content is held in ORA but is unavailable for a fixed period of time to comply with the policies and wishes of rights holders.
-
Permissions
-
All content made available in ORA should comply with relevant rights, such as copyright. See this page for more information.
-
Clearance
-
Some thesis volumes scanned as part of the digitisation scheme funded by Dr Leonard Polonsky are currently unavailable due to sensitive material or uncleared third-party copyright content. We are attempting to contact authors whose theses are affected.
Alternative access to the full-text
You may be able to access the full-text directly from the publisher's website using the 'Publisher Copy' link in the 'Links & Downloads' box from a research output's ORA record page. This method may require an institutional or individual subscription to the journal/resource.
Authors
Funding
+ Engineering and Physical Research Council
More from this funder
Funding agency for:
Zivny, S
Grant:
EP/L021226/1
+ Engineering and Physical Research Council
More from this funder
Funding agency for:
Cooper, M
Grant:
EP/L021226/1
Bibliographic Details
- Publisher:
- IfCoLog (International Federation of Computational Logic) Publisher's website
- Journal:
- Logical Methods in Computer Science Journal website
- Volume:
- 13
- Issue:
- 4
- Pages:
- 1-32
- Publication date:
- 2017-12-27
- Acceptance date:
- 2017-11-06
- DOI:
- EISSN:
-
1860-5974
- ISSN:
-
1860-5974
- Source identifiers:
-
743546
Item Description
- Pubs id:
-
pubs:743546
- UUID:
-
uuid:a983682c-3cd0-40b7-83d1-49e30d731d61
- Local pid:
- pubs:743546
- Deposit date:
- 2017-11-06
Terms of use
- Copyright holder:
- © Cooper and Živný
- Copyright date:
- 2017
- Notes:
- This is an Open Access article published under a Creative Commons licence, see: https://creativecommons.org/licenses/by-nd/2.0/
If you are the owner of this record, you can report an update to it here: Report update to this record