Subject
Computer Science
Topic
Artificial Intelligence
Means-ends analysis, which reduces the difference between the current state and the goal, was used in which early AI program?
Means-ends analysis, which reduces the difference between the current state and the goal, was used in which early AI program?
a)
ELIZAb)
MYCINc)
General Problem Solver (GPS)d)
Deep BlueExplanation
Newell and Simon's GPS (1959) used means-ends analysis to solve problems step by step.Related questions
In the figure, using alphabetical tie-breaking, what is the breadth-first visit order from A?In the figure, using alphabetical tie-breaking, what is the depth-first preorder from A?In the figure, using alphabetical tie-breaking, what is the uniform-cost path cost from S?In the figure, what is the cost of the path that A* search returns from S to G, assuming its heuristic is admissible?For edges P-Q-1,P-R-1,Q-S-1,R-T-1,S-U-1, what order does DFS preorder produce from P with alphabetical tie-breaking?Using uniform-cost search on weighted edges S-A-2,S-B-6,A-C-2,B-C-1,C-G-4, what is the least cost from S to G?A heuristic gives values 5,3,0; the corresponding true remaining costs are 4,3,0. Is it admissible?A unit-cost tree has a very shallow solution but high branching. Which complete uninformed method is the natural choice?