Identifying Inconsistent CSPs by Relaxation

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.

• Type: Conference
• Year: 2003
• Where: CP
• Authors: Tomas Eric Nordlander, Ken N. Brown, Derek H. Sleeman
• Keywords: Constraint Graph Properties, CP 2003, Inconsistent Csps, Paper Presents Relaxation, Programming Languages