Abstract
Boolean Symbolic Objects were introduced by Diday (1988) and since that time a large number of applications have been defined, using these objects, but relatively few of them take constraints on the variables into account. Even in this case, when the graph of dependencies becomes too large, the computational time becomes huge because dependencies are treated in a combinatorial way. We present a method inspired by the technique used in relational data bases (Codd 1972) leading to a decomposition of symbolic objects into a Normal Symbolic Form which allows an easier calculation, however huge the graph of dependencies rules may be. We will apply our method to distance computation following a method due to De Carvalho and inspired by Ichino (1994) but the normal form we present in this paper could be used for other purposes. In our first trials we obtained a 90% reduction of the computational time. In the present text we will only deal with nominal boolean Symbolic Objects, but the method could be used with other kinds of symbolic objects.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
