Publica
Hier finden Sie wissenschaftliche Publikationen aus den FraunhoferInstituten. The proportional constraint and its pruning
 Seipel, Dietmar (Ed.): Declarative Programming and Knowledge Management : Conference on Declarative Programming, DECLARE 2017, Unifying INAP, WFLP, and WLP, Würzburg, Germany, September 1922, 2017, Revised Selected Papers Cham: Springer International Publishing, 2018 (Lecture Notes in Artificial Intelligence 10997) ISBN: 9783030008000 (Print) ISBN: 9783030008017 (Online) ISBN: 9783030008024 S.5363 
 Conference on Declarative Programming (DECLARE) <2017, Würzburg> International Conference on Applications of Declarative Programming and Knowledge Management (INAP) <21, 2017, Würzburg> Workshop on Logic Programming (WLP) <31, 2017, Würzburg> Workshop on Functional and (Constraint) Logic Programming (WFLP) <25, 2017, Würzburg> 
 Bundesministerium für Wirtschaft und Energie BMWi 03ET1312A; WaveSave 

 Englisch 
 Konferenzbeitrag 
 Fraunhofer FOKUS () 
 bounds consistency; finite domain constraint programming; fixedpoint iteration; proportional constraint; pruning rule 
Abstract
Motivated by the necessity to model the energy loss of energy storage devices, a Proportional Constraint is introduced in finite integer domain Constraint Programming. Therefore rounding is used within its definition. For practical applications in finite domain Constraint Programming, pruning rules are presented and their correctness is proven. Further, it is shown by examples that the number of iterations necessary to reach a fixedpoint while pruning depends on the considered constraint instances. However, fixedpoint iteration always results in the strongest notion of bounds consistency. Furthermore, an alternative modeling of the Proportional Constraint is presented. The runtimes of the implementations of both alternatives are compared showing that the implementation of the Proportional Constraint on the basis of the presented pruning rules performs always better on sample problem classes.