Computer Science – Programming Languages
Scientific paper
2001-09-13
Computer Science
Programming Languages
11 pages. Proceedings ERCIM WG on Constraints (Prague, June 2001)
Scientific paper
The model of Dynamic Meta-Constraints has special activity constraints which can activate other constraints. It also has meta-constraints which range over other constraints. An algorithm is presented in which constraints can be assigned one of five different satisfaction values, which leads to the assignment of domain values to the variables in the CSP. An outline of the model and the algorithm is presented, followed by some initial results for two problems: a simple classic CSP and the Car Configuration Problem. The algorithm is shown to perform few backtracks per solution, but to have overheads in the form of historical records required for the implementation of state.
No associations
LandOfFree
Assigning Satisfaction Values to Constraints: An Algorithm to Solve Dynamic Meta-Constraints 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 Assigning Satisfaction Values to Constraints: An Algorithm to Solve Dynamic Meta-Constraints, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Assigning Satisfaction Values to Constraints: An Algorithm to Solve Dynamic Meta-Constraints will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-540649