Constraint Based Reasoning with Constraint Logic Programming and Array Based Logic

The paper describes how Constraint Based Reasoning (CBR) can be performed with two different paradigms, Constraint Logic Programming (CLP) and Array Based Logic (ABL). The author describes the operation of Constraint Logic Programming emphasizing CLP techniques for finite domain problems such as search strategies and consistency techniques. An explanation of Array Based Logic is presented including a description of methods for creating, joining and compressing ABL relations as well as an heuristic for building a system of relations in ABL. A familiar cryptogram is used as an example to demonstrate the operation of the two approaches for finite domain constraint problems. Some potential avenues of research are also presented. 1 Introduction In recent years, there has been a substantial increase in interest in Constraint Based Reasoning (CBR) among computer scientists and engineers. The great potential of CBR as a problem solving tool is becoming increasingly apparent. Known areas of ..