Abstract

£ The existence of a model for a logic program is generally established by lattice-theoretic arguments. We present three examples to show that metric methods can often be used instead, generally in a direct, straightforward way. One example is a game program, which is not stratified or locally stratified, but which has a unique supported model whose existence is easily established using metric methods. The second example is a program without a unique supported model, but having a part that is ‘well-behaved.’ The third example is a program in which one part depends on another, illustrating how modularity might be treated metrically. Finally we use ideas from this third example to prove a general result from [3]. The intention in presenting these examples and the theorem is to stimulate interest in..