Identifying Intelligence - Natural and Artificial Reasoning - page 28

Purpose

Insight Reason

Perceptions Concepts Heuristics Criteria

Pro bl em Solution

Abstract Abduce Deduce Validate

Fig. 3.2 The intelligence process

Table 3.1 Truth table for the
hypothesis 'Implies'

Xisavowel Yiseven X implies Y

1 True True True

2 True False False

3 False True True

4 False False True

A simple computer program, ' confirm ', can illustrate the process of choosing an
action. This program will generate the correct minimum set of tests for any range of
logic-based hypothesis using two sided cards. Three examples of its output are 1 :

QUERY > confirm that [vowel implies even] in list ['A' 'D' #4 #7]
Try cards [ 'A' #7 ]
QUERY > confirm that [vowel or even] in list ['A' 'D' #4 #7]
Try cards [ 'D' #7 ]
QUERY > confirm that [vowel and even] in list ['A' 'D' #4 #7]
Try cards [ 'A' #4 ]

The program has been written in Clarity. Clarity is a Schematic Functional pro-
gramming language. This language is fully described in the topic Addis & Addis
Drawing Programs: The Theory and Practice of Schematic Functional Program-
ming, Springer (Addis and Addis 2010 ). The diagram below is the Clarity Schematic
' confirm '. Such a diagram can be considered as a simple flowchart of linked
processes as shown in Fig. 3.3 .

1 The command and responses have been made easier to read. The actual command for the first
example is: > confirm [implies isvowel iseven] ['A' 'D' #4 #7] and the actual reply is simply ['D'
#7]. In the other queries 'or' is '||' and 'and' is '&&'.