Coloring Maps and the Kowalski Doctrine

McCarthy, John (1982) Coloring Maps and the Kowalski Doctrine. [Preprint]

Full text available as:

[img] Postscript


It is attractive to regard an algorithm as composed of the logic determining what the results are and the control determining how the result is obtained. Logic programmers like to regard programming as controlled deduction, and there have been several proposals for controlling the deduction expressed by a Prolog program and not always using Prolog's normal backtracking algorithm. The present note discusses a map coloring program proposed by Pereira and Porto and two coloring algorithms that can be regarded as control applied to its logic. However, the control mechanisms required go far beyond those that have been contemplated in the Prolog literature. Robert Kowalski (1979) enunciated the doctrine expressed by the formula

Item Type:Preprint
Subjects:Computer Science > Artificial Intelligence
ID Code:424
Deposited By: McCarthy, John
Deposited On:27 Feb 1998
Last Modified:11 Mar 2011 08:53


Repository Staff Only: item control page