约束满足值的确定：一种求解动态元约束的算法
Assigning Satisfaction Values to Constraints: An Algorithm to Solve Dynamic Meta-Constraints
摘要：
动态元约束模型具有特殊的活动约束，可以激活其他约束。它还具有元约束，其范围超过其他约束。提出了一种算法，在该算法中，约束可以被分配给五个不同的满意度值，这导致域值分配给CSP中的变量。概述的模型和算法，其次是一些初步的结果，两个问题：一个简单的经典CSP和汽车配置问题。该算法被证明是每个解决方案执行几个回溯，但有开销的形式所需的实施状态的历史记录。
英文摘要：
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.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
