Scheduling In High-Level Synthesis Using A Hybrid Constraint Logic Programming /Integer Programming Approach

2006 ◽  
Author(s):  
Mohamed Ahmed ◽  
Hany Abdel-malek
Keyword(s):  
Integer Programming ◽  
Logic Programming ◽  
Constraint Logic Programming ◽  
High Level Synthesis ◽  
Programming Approach ◽  
High Level

CONSTRAINT LOGIC PROGRAMMING APPROACH OF NETWORK FLOW PROBLEMS WITHIN A DECISION SUPPORT SYSTEMS GENERATOR FOR TRANSPORTATION PLANNIG

1998 ◽  
Vol 07 (04) ◽  
pp. 453-462
Author(s):  
CRISTINA FIERBINTEANU
Keyword(s):  
Decision Support ◽  
Logic Programming ◽  
Decision Support Systems ◽  
Network Flow ◽  
Support Systems ◽  
Constraint Logic Programming ◽  
Programming Approach ◽  
Network Flow Problems ◽  
Constraint Solver ◽  
Flow Problems

In this paper we propose a model of a decision support systems (DSS) generator for unstructured problems. The model is developed within the constraint logic programming (CLP) paradigm. At the center of the generator there is an ontology defining the concepts and relationships necessary and sufficient to describe the domain to be reasoned about, in a manner suitable for a particular class of tasks. The constraint solver of the constraint logic programming host language has to be extended with constraints which are relevant to the domain studied, but can not be found among the general constraints provided by the constraint solver. The domain of transportation planning was chosen to illustrate the proposed concept of DSS generator for ustructured problems. In this case we need to extend the constraint solver with constraint manipulation techniques specific to network flow problems. This paper presents in detail our constraint logic programming approach of network flow problems.

scholarly journals A Hybrid Method for the Modelling and Optimisation of Constrained Search Problems

2014 ◽  
Vol 5 (3) ◽  
pp. 7-22 ◽  
Author(s):  
Pawel Sitek ◽  
Jaroslaw Wikarek
Keyword(s):  
Integer Programming ◽  
Logic Programming ◽  
Hybrid Method ◽  
Vehicle Routing Problem ◽  
Hybrid Approach ◽  
Constraint Logic Programming ◽  
Decision Models ◽  
Routing Problem ◽  
Constrained Problems ◽  
Decision Variables

AbstractThe paper presents a concept and the outline of the implementation of a hybrid approach to modelling and solving constrained problems. Two environments of mathematical programming (in particular, integer programming) and declarative programming (in particular, constraint logic programming) were integrated. The strengths of integer programming and constraint logic programming, in which constraints are treated in a different way and different methods are implemented, were combined to use the strengths of both. The hybrid method is not worse than either of its components used independently. The proposed approach is particularly important for the decision models with an objective function and many discrete decision variables added up in multiple constraints. To validate the proposed approach, two illustrative examples are presented and solved. The first example is the authors’ original model of cost optimisation in the supply chain with multimodal transportation. The second one is the two-echelon variant of the well-known capacitated vehicle routing problem.

Enhancing High-Level Synthesis Using a Meta-Programming Approach

2021 ◽  
pp. 1-1
Author(s):  
Jessica Vandebon ◽  
Jose Gabriel De Figueiredo Coutinho ◽  
Wayne Luk ◽  
Eriko Nurvitadhi
Keyword(s):  
High Level Synthesis ◽  
Programming Approach ◽  
Meta Programming ◽  
High Level
Sign in / Sign up

Export Citation Format

Share Document