Models and Tools for Improving Efficiency in Constraint Logic Programming
Journal Title: Decision Making in Manufacturing and Services - Year 2011, Vol 5, Issue 1
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.
Authors and Affiliations
Antoni Ligęza
Keywords
Related Articles
- EP ID EP167002
- DOI 10.7494/dmms.2011.5.1.69
- Views 71
- Downloads 0
Interval methods for computing strong Nash equilibria of continuous games
The problem of seeking strong Nash equilibria of a continuous game is considered. For some games these points cannot be found analytically, only numerically. Interval methods provide us an approach to rigorously verify t...
Corrigendum to ”Neighbourhood Properties in Some Single Processor Scheduling Problem with Variable Efficiency and Additional Resources”
Amendment to [Decision Making in Manufacturing and Services, vol. 5 (1–2), 2011, pp. 5–17
BPMN – A Logical Model and Property Analysis
Business Process Modeling Notation has become a powerful and widely accepted visual language for modeling business processes. Despite its expressive power and high usability, a weak point of BPMN is the lack of formal se...
Resource Management in Machine Scheduling Problems: A Survey
The paper is a survey devoted to job scheduling problems with resource allocation. We present the results available in the scientific literature for commonly used models of job processing times and job release dates, i.e...
Scheduling Jobs with Linear Model of Simultaneous Ageing and Learning Effects
In the paper, we introduce some new scheduling model in which learning and aging effects are both considered simultaneously. In this model the actual processing time of the jobs depends only on its position in a schedule...