Models and Tools for Improving Efficiency in Constraint Logic Programming

Antoni Ligęza

Abstract


Constraint Satisfaction Problems typically exhibit strong combinatorial explosion. In this paper we present some models and techniques aimed at improving efficiency in Constraint Logic Programming. A hypergraph model of constraints is presented and an outline of strategy planning approach focused on entropy minimization is put forward. An example cryptoaritmetic problem is explored in order to explain the proposed approach.


Keywords


Constraint Satisfaction Problem; Constraint Programming; Constraint Logic Programming

Full Text:

PDF


DOI: http://dx.doi.org/10.7494/dmms.2011.5.1.69

Refbacks

  • There are currently no refbacks.