Resumen:
Bousi∼Prolog: Design and implementation of a proximity-based fuzzy logic programming language.

Fecha

2023-09-12

Editor

Sistedes

Publicado en

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

Licencia

CC BY-NC-ND 4.0

Resumen

The fuzzy logic programming language Bousi∼Prolog extends Prolog with a weak unification algorithm based on proximity relations and truth degree annotations. The weak unification algorithm makes the search for answers more flexible, while rule annotations make possible knowledge-based applications where the rules may be uncertain. In this paper, after recalling the main concepts supporting this language, we detail its design and implementation. We describe the implementation of its operational semantics, which is based on compiling programs and queries into Prolog, and those important features that makes it more applicable: fuzzy sets, integration with WordNet and efficiency techniques. The result is a high-level open-source implementation of the Bousi∼Prolog system, written on top of SWI-Prolog, and publicly available. We also summarise some experiments measuring its performance compared to other systems. [Work already published: Expert Syst. Appl. 213(Part): 118858 (2023) ]

Descripción

Acerca de Julián Iranzo, Pascual

Palabras clave

Fuzzy Logic Programming, Fuzzy Prolog, Bousi∼Prolog, Weak Unification, Weak SLD Resolution, Proximity Relations

Colecciones

Página completa del ítem
Notificar un error en este resumen
Mostrar cita
Mostrar cita en BibTeX
Descargar cita en BibTeX