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



To overcome the need to backtrack in constraint satisfaction problem can be eliminated by a) Forwar..

Answer / neer

a) Forward Searching

Is This Answer Correct ?    0 Yes 0 No

Post New Answer

More AI Robotics Interview Questions

What is a robot locomotion?

0 Answers  


Name some expert system technology?

0 Answers  


 ____________ is/are useful when the original formulation of a problem is altered in some way, typically because the set of constraints to consider evolves because of the environment. a) Static CSPs b) Dynamic CSPs c) Flexible CSPs d) None of the above

1 Answers  


Which was the first industrial robot?

0 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  






Which environment is called as semidynamic? a) Environment does not change with the passage of time b) Agent performance changes c) Environment will be changed d) Both a & b

0 Answers  


What is prolog used in artificial intelligence?

0 Answers  


In hidden markov model, how does the state of the process is described?

0 Answers  


What is artificial intelligence robotics?

0 Answers  


What is the action of task environment in artificial intelligence? a) Problem b) Solution c) Agent

0 Answers  


List the name of the areas where the robotics can be applied?

0 Answers  


In which state spaces does the online-dfs-agent will work? a) Irreversible state spaces b) Reversible state spaces c) searchable state spaces d) All of the mentioned

0 Answers  


Categories