On Minimal Constraint Networks

Details On Minimal Constraint Networks On Minimal Constraint Networks

2011-03-08

arxiv.org/abs/1103.1604v4

Computer Science

Artificial Intelligence

Preprint, identical to paper to appear at CP 2011; 15 pages

Scientific paper

In a minimal binary constraint network, every tuple of a constraint relation can be extended to a solution. It was conjectured that computing a solution to such a network is NP complete. We prove this conjecture. We also prove a conjecture by Dechter and Pearl stating that for k>1 it is NP-hard to decide whether a constraint network can be decomposed into an equivalent k-ary constraint network, and study related questions.

Affiliated with

Also associated with

No associations

Rating

On Minimal Constraint Networks does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with On Minimal Constraint Networks, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On Minimal Constraint Networks will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-83151