人工智能邏輯-wenkub.com
2025-08-01 13:31 本頁面
【正文】 while (act !=0) { actsetStartTime(actgetStartMin())。amp。 } 2022/8/21 史忠植 高級人工智能 54 Algorithm Program CtActivity* SelectActivity(CtSchedule* schedule){ // Returns the unscheduled activity with the smallest latest // statrt time. Returns 0 if all activities are scheduled. CtActivity* bestActivity = 0。 else return CtTrue。 2022/8/21 史忠植 高級人工智能 51 Constraints //To create a total budget of limited capacity (here 29000). CtDiscreteResource* res = new CtDiscreteResource(schedule, CtRequiredResource, capacity)。 CtOr(Constraint(x == a), CtAnd(Constraint(x != a), CtInstantiate(x)))。 10 interprete objectattribute pair: 11 case function call: 2022/8/21 史忠植 高級人工智能 42 COPS 12 interprete function call: 13 case method call: 14 interprete method call: 15 case CASE expression: 16 interprete CASE expression: 17 ... 18 default: 20 report error 21 } 2022/8/21 史忠植 高級人工智能 43 ILOG SOLVER Combines object oriented programming with constraint logic programming, containing logic variables, incremental constraint satisfaction and backtracking. variables : C++ object integer variable CtIntVar floating variable CtFloatVar boolean variable CtBoolVar Memory Management new: delete: 2022/8/21 史忠植 高級人工智能 44 ILOG SOLVER Constraints CtTell(x == (y + z))。 ... //function definition function_name。 boolean expression_m: constraint_m。 8 end AC3 ? ? ? ?? ?V V G i ji j, ,? ? a r c s 2022/8/21 史忠植 高級人工智能 30 Backjumping BackjumpingTop(P) 1 f := the null assignment 2 answer, conflictset := Backjumping(f,P) 3 return answer 2022/8/21 史忠植 高級人工智能 31 Backjumping Backjumping(f,P) 1 if f is a total assignment of the variables in P 2 answer := f,? 3 else 4 v := some variable in P that is not yet assigned a value by f 5 answer := Unsat 6 conflictset := ? 7 for each value 8 f(v) := x 9 if f satisfies the constraints in P 10 answer, newconflicts := Backjumping(f,P) 2022/8/21 史忠植 高級人工智能 32 Backjumping 11 else 12 newconflicts := the set of variables in a violated constraint 13 if answer ? Unsat 14 return answer, ? 15 else if v ? newconflicts 16 return Unsat, newconflicts 17 else 18 conflictset := conflictset ? (newconflicts {v}) 19 return Unsat, conflictset 2022/8/21 史忠植 高級人工智能 33 COPS Constraint : predicate expression P(t1, ..., tn) where P is built in function, such as sum times
高考資料相關(guān)推薦
鄂ICP備17016276號-1