La logique informatique
(selon les travaux de J.D WARNIER)
L.C.P Logic of Programs construction
The "complex" structures of programs :
"Alternative" complex structure :
A set of data of "Alternative" complex structure is a set in which several subsets are noted
(0 or 1 times) and non-exclusive.
by convention, when several Subsets are noted (0-1) in a set, the symbol + is used to signify that these Sub-sets are non-exclusive, ie it is a complex alternative data structure.
How to determine the optimized structure of a complex alternative structure !
When several sub-sets of data at the same level of hierarchical subdivision are used (0-1 times) and these are in Union (+) (therefore not disjoint), we must realize,the mathematical union of all these subsets in order to discover all the data subsets to which the actions to be programmed relate, and thus be able to carry out the simplifications which are necessary and thus discover the most appropriate structure.
Discover the subsets to which the actions relate :
In order to do this, we must establish a truth table in order to discover all the possible intersections, and therefore all the Subsets on which the actions to be programmed must be carried.
Here is an example : Let two Subsets in union of a repository R
Repository Truth table VEITCH Diagram
Vide = Empty !
Let us now simplify the Boolean expressions of each action :
Action 1 = A.B + A.B Action 2 = A.B
= B(A+A)
= B(1)
= B
A VEITCH Diagram to check is always interesting.
We have just discovered the structure of our complex alternative !
(It will be a tree.) Why will you tell me ?
This is what I propose to see now .......