Models and Tools for Improving Efficiency in Constraint Logic Programming
DOI:
https://doi.org/10.7494/dmms.2011.5.1.69Keywords:
Constraint Satisfaction Problem, Constraint Programming, Constraint Logic ProgrammingAbstract
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.
Downloads
Published
How to Cite
Issue
Section
License
Remeber to prepeare, sign and scan copyright statement
The content of the journal is freely available according to the Creative Commons License Attribution 4.0 International (CC BY 4.0)
Accepted 2013-08-20
Published 2011-10-03