Constraint Satisfaction
387
浏览
0
关注

In artificial intelligence and operations research, constraint satisfaction is the process of finding a solution to a set of Constraint (mathematics)|constraints that impose conditions that the Variable (mathematics)|variables must satisfiability|satisfy. A solution is therefore a vector of variables that satisfies all constraints. The techniques used in constraint satisfaction depend on the kind of constraints being considered. Often used are constraints on a finite domain, to the point that constraint satisfaction problems are typically identified with problems based on constraints on a finite domain. Such problems are usually solved via Search algorithm|search, in particular a form of backtracking or local search (constraint satisfaction)|local search. Constraint propagation are other methods used on such problems; most of them are incomplete in general, that is, they may solve the problem or prove it unsatisfiable, but not always. Constraint propagation methods are also used in...
[展开]
主要的会议/期刊
演化趋势
Chart will load here
Constraint Satisfaction文章数量变化趋势

Feedback
Feedback
Feedback
我想反馈:
排行榜