constraint satisfaction

基本解釋

Constraint Programming and Constraint satisfaction problem is new research domain in AI developed in last thirty years.
約束編程與約束滿足問題是近三十年來在人工智能領(lǐng)域發(fā)展起來的一個研究方向。
Constraint satisfaction problems are a large category of complex problems in real world applications, noted for various constraints.
約束可滿足性問題是一大類常出現(xiàn)于現(xiàn)實應(yīng)用中的復雜問題，因其繁多的約束條件而出名。
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.
約束修正是衛(wèi)星成像調(diào)度的重要組成部分，負責處理成像調(diào)度方案的約束滿足與優(yōu)化的問題。

約束可滿足
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問題是指可滿足布爾表達式的集合，它在數(shù)理邏輯、人工智能、約束可滿足性問題、VLSI集成電路設(shè)計與檢測、計算機科學理論、計算機視覺、機器定理證明、機器人規(guī)劃、機器學習等領(lǐng)域具有廣闊的應(yīng)用背景。
限制求解
約束滿足

約束滿足
The replacement parameters, reasoning rules, constraint satisfaction solving and checking parameters were included in the process of whole modification.
事例修改過程包括參數(shù)替換、規(guī)則推理基于約束滿足求解和參數(shù)檢查這些步驟。
哲學
限制滿足