Translation-based Constraint Answer Set Solving

Details Translation-based Constraint Answer Set Solving Translation-based Constraint Answer Set Solving

2011-04-20

arxiv.org/abs/1104.3927v1

Computer Science

Artificial Intelligence

Self-archived version for IJCAI'11 Best Paper Track submission

Scientific paper

We solve constraint satisfaction problems through translation to answer set
programming (ASP). Our reformulations have the property that unit-propagation
in the ASP solver achieves well defined local consistency properties like arc,
bound and range consistency. Experiments demonstrate the computational value of
this approach.

Affiliated with

Also associated with

No associations

Rating

Translation-based Constraint Answer Set Solving 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 Translation-based Constraint Answer Set Solving, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Translation-based Constraint Answer Set Solving will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-431984