On the Safe Execution of Symbolic Similarity-based Fuzzy Logic Programs





Publicado en

Actas de las XXII Jornadas sobre Programación y Lenguajes (PROLE 2023)

Licencia Creative Commons


Introducing “Fuzzy Aggregators and Similarity Into a Logic Language” leads to FASILL, whose symbolic extension (called sFASILL) is able to manage both concrete and unknown (symbolic constants) truth degrees, similarity annotations and fuzzy connectives. The symbolic execution of sFASILL programs helps to guess the impact of such unknown symbols on the outputs before instantiating them with concrete values in program rules and similarity relations. In this paper we reason about the constraints that symbolic substitutions must satisfy in order to preserve the set of fuzzy computed answer obtained at execution time before or after instantiating a given sFASILL program. Based on such safeness conditions, we have formally proved two theoretical results with different levels of generality/practicability for correctly executing symbolic sFASILL and instantiated FASILL programs.


Acerca de Moreno, Ginés

Palabras clave

Fuzzy Logic Programming, Similarity, Symbolic Execution
Página completa del ítem
Notificar un error en este artículo
Mostrar cita
Mostrar cita en BibTeX
Descargar cita en BibTeX