Question: Kowalski [1988] makes the following statement about his pseudoequation A(lgorithm) = L(ogic) + C(ontrol): With Prolog we have a fixed C and can improve A

Kowalski [1988] makes the following statement about his pseudoequation A(lgorithm) = L(ogic) + C(ontrol): With Prolog we have a fixed C and can improve A only by improving L. Logic programming is concerned with the possibility of changing both L and C. Explain why he says this. Explain why it is not completely true that Prolog cannot change C.

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Programming Questions!