Dedekind-MacNeille completion and Cartesian product of multi-adjoint lattices

Fuzzy logic programming tries to introduce fuzzy logic into logic programming in order to provide new generation computer languages which incorporate comfortable programming resources for helping the development of applications where uncertainty could play an important role. In this sense, the mathematical concept of multi-adjoint lattice has been successfully exploited into the so-called Multi-Adjoint Logic Programming approach, MALP in brief, for modelling flexible notions of truth-degrees beyond the simpler case of true and false. In this paper, we focus on two relevant mathematical concepts for this kind of domains useful for evaluating MALP. On the one side, we adapt the classical notion of Dedekind-MacNeille completion in order to relax some usual hypothesis on such kind of ordered sets, and next we study the advantages of generating multi-adjoint lattices as the Cartesian product of previous ones. On the practical side, we show that the formal mechanisms described before have direct correspondences with interesting debugging tasks into the 'Fuzzy Logic Programming Environment for Research', FLOPER in brief, developed in our research group.