Solving logic problems with object-oriented constraint logic programming

The authors examine the solution to logic problems via traditional logic programming, constraint logic programming (CLP), and object-oriented CLP. CLP builds on the desirable declarative properties of logic programming by incorporating consistency algorithms to provide an efficient tool suitable for solving logic problems. However, CLP lacks any built-in mechanism for structuring programs, and casting the problem as a CSP (constraint satisfaction problem) actually results in a loss of declarativeness. Alternatively, an object-oriented CLP framework increases readability through the mapping of objects to elements in the problem description, In addition, it provides both an efficient computation strategy and a reusable structure and methodology for solving logic problems.<
>