Identifying inconsistent CSPs by Relaxation
(2003) Identifying inconsistent CSPs by Relaxation. Technical Report TR0304, Computing science, University of Aberdeen.
Full text available as:
 | Postscript - Requires a viewer, such as GhostView |
How do we identify inconsistent CSPs quickly? This paper presents relaxation as one possible method; showing how we can generate relaxed CSPs which are easier to prove inconsistent. We examine different relaxation strategies based on constraint graph properties, and we show that removing constraints of low tightness is an efficient strategy which is also simple to implement.
| Subjects: | Status > AKT Submitted |
|---|---|
| ID Code: | 301 |
| Deposited By: | Nordlander, Mr Tomas Eric |
| Deposited On: | 08 June 2004 |
Contact the site administrator at: hg@ecs.soton.ac.uk