constraint satisfaction

基本解释

Constraint Programming and Constraint satisfaction problem is new research domain in AI developed in last thirty years.
约束编程与约束满足问题是近三十年来在人工智能领域发展起来的一个研究方向。
Constraint satisfaction problems are a large category of complex problems in real world applications, noted for various constraints.
约束可满足性问题是一大类常出现于现实应用中的复杂问题，因其繁多的约束条件而出名。
Constraint modification is the important part of imaging scheduling of earth observing satellite, it solves the problem of constraint satisfaction and optimization of the imaging scheduling.
约束修正是卫星成像调度的重要组成部分，负责处理成像调度方案的约束满足与优化的问题。

约束可满足
SAT problem is the set of satisfiable boolean formulas,which can be widely used in such fields as symbolic logic,artificial intelligence,constraint satisfaction problem,design and detection of VLSI integrate circuit,theories of computer science,computer vision,proof of machine theory,robot program,and machine learning.
SAT问题是指可满足布尔表达式的集合，它在数理逻辑、人工智能、约束可满足性问题、VLSI集成电路设计与检测、计算机科学理论、计算机视觉、机器定理证明、机器人规划、机器学习等领域具有广阔的应用背景。
限制求解
约束满足

约束满足
The replacement parameters, reasoning rules, constraint satisfaction solving and checking parameters were included in the process of whole modification.
事例修改过程包括参数替换、规则推理基于约束满足求解和参数检查这些步骤。
哲学
限制满足