Navegación

Búsqueda

Búsqueda avanzada

An Efficient Proximity-based Unification Algorithm (Trabajo ya publicado)

Resumen:

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)]

Palabras Clave:

Fuzzy Logic Programming - Fuzzy Prolog - Proximity Relations - Weak Unification

Autor(es):

Handle:

11705/PROLE/2018/013

Descargas:

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

Descarga el artículo haciendo click aquí.