A Translational Approach to Constraint Answer Set Solving

Computer Science – Logic in Computer Science

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

17 pages

Scientific paper

We present a new approach to enhancing Answer Set Programming (ASP) with Constraint Processing techniques which allows for solving interesting Constraint Satisfaction Problems in ASP. We show how constraints on finite domains can be decomposed into logic programs such that unit-propagation achieves arc, bound or range consistency. Experiments with our encodings demonstrate their computational impact.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

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

Rate now

     

Profile ID: LFWR-SCP-O-138921

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.