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  

---

 What among the following constitutes to the incremental formulation of CSP? a) Path cost b) Goal cost c) Successor function d) Objective function e) Initial state

0 Answers  

---

What is natural language processing?

0 Answers  

---

What is lisp?

0 Answers  

---

Consider a problem of preparing a schedule for a class of student. This problem is a type of a) Search Problem b) Backtrack Problem c) CSP d) Planning Problem

0 Answers  

---

---

What are the axes of movement of the robot?

0 Answers  

---

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

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  

---

Hill climbing sometimes called ____________ because it grabs a good neighbor state without thinking ahead about where to go next. a) Needy local search b) Heuristic local search c) Greedy local search d) Optimal local search

1 Answers  

---

What is not represented by using propositional logic? a) Objects b) Relations c) Both a & b d) None of the mentioned

0 Answers  

---

Why do we need technology intelligence?

0 Answers  

---

What kind of environment is crossword puzzle? a) Static b) Dynamic c) Semidynamic d) None of the mentioned

2 Answers  

---