Abstract
Current means-end analysis problem solvers are not capable of solving problems which have certain kinds of goal interaction. The goal interaction problem is described and an example given on a block staking task. Finally, mention is made of a method of using the information gained by the discovery of goal interactions to guide the search for a problem solution.
| Original language | English |
|---|---|
| Title of host publication | Proceedings of the Fourth International Joint Conference on Artificial Intelligence (IJCAI-75) |
| Pages | 215-218 |
| Number of pages | 4 |
| Publication status | Published - Sep 1975 |