Búsqueda avanzada

String-based Multi-adjoint Lattices for Tracing Fuzzy Logic Computations


Classically, most programming languages use in a predefined way the notion of «string» as an standard data structure for a comfortable management of arbitrary sequences of characters. However, in this paper we assign a different role to this concept: here we are concerned with fuzzy logic programming, a somehow recent paradigm trying to introduce fuzzy logic into logic programming. In this setting, the mathematical concept of multi-adjoint lattice has been successfully exploited into the so-called Multi-adjoint Logic Programming approach, MALP in brief, for modeling flexible notions of truth-degrees beyond the simpler case of true and false. Our main goal points out not only our formal proof verifying that stringbased lattices accomplish with the so-called multi-adjoint property (as well as its Cartesian product with similar structures), but also its correspondence with interesting debugging tasks into the FLOPER system (from «Fuzzy LOgic Programming Environment for Research») developed in our research group.

Palabras Clave:

Cartesian Product of Multi-adjoint Lattices - Declarative Debugging - Fuzzy (Multi-adjoint) Logic Programming





Este artículo tiene una licencia de uso CreativeCommons - Reconocimiento (by)

Descarga el artículo haciendo click aquí.

Ver la referencia en formato Bibtex