Variable and value elimination in binary constraint satisfaction via forbidden patterns
- Submitting institution
-
Royal Holloway and Bedford New College
- Unit of assessment
- 11 - Computer Science and Informatics
- Output identifier
- 29010883
- Type
- D - Journal article
- DOI
-
10.1016/j.jcss.2015.02.001
- Title of journal
- Journal of Computer and System Sciences
- Article number
- -
- First page
- 1127
- Volume
- 81
- Issue
- 7
- ISSN
- 0022-0000
- Open access status
- Out of scope for open access requirements
- Month of publication
- March
- Year of publication
- 2015
- URL
-
-
- Supplementary information
-
-
- Request cross-referral to
- -
- Output has been delayed by COVID-19
- No
- COVID-19 affected output statement
- -
- Forensic science
- No
- Criminology
- No
- Interdisciplinary
- No
- Number of additional authors
-
3
- Research group(s)
-
-
- Citation count
- 13
- Proposed double-weighted
- No
- Reserve for an output with double weighting
- No
- Additional information
- The Constraint Satisfaction Paradigm (CSP) is natural in many problem domains: finding assignments to variables satisfying (local) constraints. We simplify problems by removing values for variables, or even entire variables, which has a long history and can be useful in practical solvers. We completely characterise the forbidden patterns that allow variables or values to be removed, defined by forbidding patterns from occurring in the miscrostructure (graph) of an instance. These results extend and give a theoretical basis to both Freuder's seminal work on neighbourhood substitution, and the important class defined by the Broken Triangle Property.
- Author contribution statement
- -
- Non-English
- No
- English abstract
- -
