To determine how hard it is for computers to solve problems, researchers have classified groups of problems (polynomial hierarchy) according to how much time they seem to require for their solutions. A difficult and complex proof is offered which shows that a combinatorial approach (using Boolean circuits) may resolve the problem. (JN)

Discusses various aspects of artificial intelligence, focusing on three interrelated issues: (1) representation of knowledge, which is roughly the machine equivalent of human memory; (2) control and use of knowledge, which corresponds to human abilities in problem solving and planning; and (3) the acquisition of knowledge, or what humans call…

Describes an artificial intelligence system known as SOAR that approximates a theory of human cognition. Discusses cognition as problem solving, working memory, long term memory, autonomy and adaptability, and learning from experience as they relate to artificial intelligence generally and to SOAR specifically. Highlights the status of the…

Traces the history and function of State, Operator, And Result (SOAR), a general-purpose artificial intelligence program for solving problems. The SOAR can "chunk" the result of a subgoal and learn from previous experiences. The SOAR could be applied to various expert systems. (YP)