Solving a constraint satisfaction problem on a finite domain is an/a ___________ problem with respect to the domain size.
a) P complete
b) NP complete
c) NP hard
d) Domain dependent
No Answer is Posted For this Question
Be the First to Post Answer
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
for online search in ‘artificial intelligence’ which search agent operates by interleaving computation and action?
Where does the performance measure is included? a) Rational agent b) Task environment c) Actuators d) Sensor
Which were built in such a way that humans had to supply the inputs and interpret the outputs? a) Agents b) AI system c) Sensor d) Actuators
What is the space complexity of Greedy search? a) O(b) b) O(bl) c) O(m) d) O(bm)
How many types of agents are there in artificial intelligence? a) 1 b) 2 c) 3 d) 4
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
_________________ are mathematical problems defined as a set of objects whose state must satisfy a number of constraints or limitations. a) Constraints Satisfaction Problems b) Uninformed Search Problems c) Local Search Problems d) Only a) and b)
Name some expert system technology?
What are the laws of the robotics?
What is fopl stands for and explain its role in artificial intelligence?
What are roles in ai career?