A Comparison of Logic Programming Approaches for Representation and Solving of Constraint Satisfaction Problems

Details A Comparison of Logic Programming Approaches for Representation and Solving of Constraint Satisfaction Problems A Comparison of Logic Programming Approaches for Representation and Solving of Constraint Satisfaction Problems

2000-03-08

arxiv.org/abs/cs/0003026v1

Computer Science

Logic in Computer Science

9 pages, 3 figures submitted to NMR 2000, April 9-11, Breckenridge, Colorado

Scientific paper

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

Affiliated with

Also associated with

No associations

Rating

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

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-143978