What Should AI Want From the Supercomputers?

PROLOG can compute quantities as answers by extract,ing values from the variable bindings imroduced in the proof of p from S, and so serves as a general purpose programming language. Logical programming languages attract many people in artificial intelligence because of the relative ease of stating declarative information in them, as compared with traditional programming languages Since most knowledge-based, expert systems contain large numbers of essentially declarative statements, the designers of the FGC expect their choice of PROLOG to facilitate the construction and operation of knowledge-based systems Parallelism enters the picture because traditional PROLOG requires that all sentences be expressed in clausal form, searches for proofs of its goal by examining the input clauses in a fixed linear order, and within clauses, examining literals in left-to-right order Many of these imposed orderings have no purely logical basis, so that, as far as questions of deducibility are concerned, greater efficiency may be possible with separat,e deduction searches conducted concurrently. In such a reorganization of PROLOG, time of execution is ideally proportional to the depth of the proof found (the size of the answer), rather than proportional to the number of alternative proofs (the size of the search space). Does S t-p? may be needlessly interest to economists is not affected by such a change. In the second, ordinal utilities were abandoned in, favor of sets of binary preferences among alternatives.