What is prolog in ai?

0 Answers  

---

Though local search algorithms are not systematic, key advantages would include a) Less memory b) More time c) Finds a solution in large infinite space d) No optimum solution

0 Answers  

---

To overcome the need to backtrack in constraint satisfaction problem can be eliminated by a) Forward Searching b) Constraint Propagation c) Backtrack after a forward search d) Omitting the constraints and focusing only on goals

1 Answers  

---

What is the degree of freedom in the robotics?

0 Answers  

---

 A problem in a search space Is defined by, a) Initial state b) Goal test c) Intermediate states d) All of the above

0 Answers  

---

What is the function of the third component of the planning system?

0 Answers  

---

Optimality of BFS is a) When there is less number of nodes b) When all step costs are equal c) When all step costs are unequal d) Both a & c

0 Answers  

---

In which of the following agent does the problem generator is present? a) Learning agent b) Observing agent c) Reflex agent d) None of the mentioned

1 Answers  

---

 A* is optimal if h(n) is an admissible heuristic-that is, provided that h(n) never underestimates the cost to reach the goal. a) True b) False

0 Answers  

---

Specify the agent architecture name that is used to capture all kinds of actions. a) Complex b) Relational c) Hybrid d) None of the mentioned

0 Answers  

---

What kind of behavior does the stochastic environment posses? a) Local b) Deterministic c) Ratioanl d) Primary

0 Answers  

---

To overcome the need to backtrack in constraint satisfaction problem can be eliminated by a) Forward Searching b) Constraint Propagation c) Backtrack after a forward search d) Omitting the constraints and focusing only on goals

0 Answers  

---