How logical inference can be solved in propositional logic?

0 Answers  

---

 In A* approach evaluation function is a) Heuristic function b) Path cost from start node to current node c) Path cost from start node to current node + Heuristic cost d) Average of Path cost from start node to current node and Heuristic cost

0 Answers  

---

Which kind of agent architecture should an agent an use? a) Relaxed b) Logic c) Relational d) All of the mentioned

0 Answers  

---

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

0 Answers  

---

Constraint satisfaction problems on finite domains are typically solved using a form of ___________. a) Search Algorithms b) Heuristic Search Algorithms c) Greedy Search Algorithms d) DFS/BFS Search Algorithms

0 Answers  

---

What is a robot locomotion?

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  

---

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 space complexity of Greedy search? a) O(b) b) O(bl) c) O(m) d) O(bm)

1 Answers  

---

The Task Environment of an agent consists of a) Sensors b) Actuators c) Performance Measures d) Environment

0 Answers  

---

Which technology uses miniaturized accelerometers and gyroscopes? a) Sensors b) Actuators c) MEMS (MicroElectroMechanical System) d) None of the mentioned

0 Answers  

---

The Set of actions for a problem in a state space is formulated by a ___________. a) Intermediate states b) Initial state c) Successor function, which takes current action and returns next immediate state d) None of the mentioned

0 Answers  

---