ptidej_solver

# Differences

This shows you the differences between two versions of the page.

 ptidej_solver [2014/03/31 14:51]yann [Problem Motifs Definitions] ptidej_solver [2017/09/06 01:54] (current) Both sides previous revision Previous revision 2014/03/31 15:19 yann [Constraints Definitions] 2014/03/31 15:18 yann [Constraints Definitions] 2014/03/31 15:17 yann [Constraints Definitions] 2014/03/31 14:51 yann [Problem Motifs Definitions] 2014/03/31 14:49 yann [Problem Motifs Definitions] 2014/03/31 14:49 yann [Problem Motifs Definitions] 2014/03/31 14:46 yann [Problem Motifs Definitions] 2014/03/31 14:43 yann [Constraints Definitions] 2014/03/31 14:34 yann [Constraints Definitions] 2014/03/31 14:29 yann [Constraints Definitions] 2014/03/31 13:49 yann 2014/02/16 08:00 yann 2013/09/25 14:20 yann 2010/03/11 22:39 ptidejteam 2010/03/11 22:38 ptidejteam created Next revision Previous revision 2014/03/31 15:19 yann [Constraints Definitions] 2014/03/31 15:18 yann [Constraints Definitions] 2014/03/31 15:17 yann [Constraints Definitions] 2014/03/31 14:51 yann [Problem Motifs Definitions] 2014/03/31 14:49 yann [Problem Motifs Definitions] 2014/03/31 14:49 yann [Problem Motifs Definitions] 2014/03/31 14:46 yann [Problem Motifs Definitions] 2014/03/31 14:43 yann [Constraints Definitions] 2014/03/31 14:34 yann [Constraints Definitions] 2014/03/31 14:29 yann [Constraints Definitions] 2014/03/31 13:49 yann 2014/02/16 08:00 yann 2013/09/25 14:20 yann 2010/03/11 22:39 ptidejteam 2010/03/11 22:38 ptidejteam created Line 61: Line 61: * ''​int weight'':​ the weight of the constraint in the problem. The sum of the weights of all the constraints in a problem should equal 100; * ''​int weight'':​ the weight of the constraint in the problem. The sum of the weights of all the constraints in a problem should equal 100; * ''​IApproximations approximations'':​ an instance of ''​ptidej.solver.approximation.IApproximations'',​ which returns and ordered array of constraint names, to try one after the other if the previous one cannot be verified; * ''​IApproximations approximations'':​ an instance of ''​ptidej.solver.approximation.IApproximations'',​ which returns and ordered array of constraint names, to try one after the other if the previous one cannot be verified; + + {{ :​binaryconstraint.png?​direct |}} + * ''​ptidej.solver.constraint.BinaryCounterConstraint'':​ for any binary constraint that count some properties between the two variables, for example a "​distance"​ in terms of number of relationships that must be followed to reach ''​v1''​ from ''​v0'';​ * ''​ptidej.solver.constraint.BinaryCounterConstraint'':​ for any binary constraint that count some properties between the two variables, for example a "​distance"​ in terms of number of relationships that must be followed to reach ''​v1''​ from ''​v0'';​ + + {{ :​binarycounterconstraint.png?​nolink |}} + * ''​ptidej.solver.constraint.UnaryConstraint'':​ for any unary constraint, i.e., constraint on a single variable to verify a property of an entity, for example if an entity is an interface vs. a class. * ''​ptidej.solver.constraint.UnaryConstraint'':​ for any unary constraint, i.e., constraint on a single variable to verify a property of an entity, for example if an entity is an interface vs. a class. + + {{ :​unaryconstraint.png?​nolink |}} ''​BinaryConstraint''​ has two sub-classes to specialise for inheritance and binary-class relationships. ''​BinaryConstraint''​ has two sub-classes to specialise for inheritance and binary-class relationships.