Logic Programming Approaches for Representing and Solving Constraint Satisfaction Problems: A Comparison

Computer Science – Artificial Intelligence

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

15 pages, 3 eps-figures

Scientific paper

Many logic programming based approaches can be used to describe and solve combinatorial search problems. On the one hand there is constraint logic programming which computes a solution as an answer substitution to a query containing the variables of the constraint satisfaction problem. On the other hand there are systems based on stable model semantics, abductive systems, and first order logic model generators which compute solutions as models of some theory. This paper compares these different approaches from the point of view of knowledge representation (how declarative are the programs) and from the point of view of performance (how good are they at solving typical problems).

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

Logic Programming Approaches for Representing and Solving Constraint Satisfaction Problems: A Comparison 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 Logic Programming Approaches for Representing and Solving Constraint Satisfaction Problems: A Comparison, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Logic Programming Approaches for Representing and Solving Constraint Satisfaction Problems: A Comparison will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-176359

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