An Efficient Proximity-based Unification Algorithm





Publicado en

Actas de las XVIII Jornadas de Programación y Lenguajes (PROLE 2018)

Licencia Creative Commons


Unification is a central concept in deductive systems based on the resolution principle. Recently, we introduced a new weak unification algorithm based on proximity relations (i.e., reflexive, symmetric, fuzzy binary relations). Proximity relations are able to manage vague or imprecise information and, in combination with the unification algorithm, allow certain forms of approximate reasoning in a logic programming framework. In this paper, we present a reformulation of the weak unification algorithm and an elaborated method to implement it efficiently. [This work has been accepted for its presentation at the 27th IEEE International Conference on Fuzzy Systems (FUZZ-IEEE 2018)]


Acerca de Julián-Iranzo, Pascual

Palabras clave

Fuzzy Logic Programming, Fuzzy Prolog, Proximity Relations, Weak Unification
Página completa del ítem
Notificar un error en este resumen
Mostrar cita
Mostrar cita en BibTeX
Descargar cita en BibTeX