Navegación

Búsqueda

Búsqueda avanzada

El autor Pascual Julian-Iranzo ha publicado 7 artículo(s):

1 - A Declarative Semantics for a Fuzzy Logic Language Managing Similarities and Truth Degrees

This work proposes a declarative semantics based on a fuzzy variant of the classical notion of least Herbrand model for the so-called FASILL language (acronym of “Fuzzy Aggregators and Similarity Into a Logic Language”) which has being recently designed and implemented in our research group for coping with implicit/explicit truth degree annotations, a great variety of connectives and unification by similarity.

Autores: Pascual Julián-Iranzo / Ginés Moreno / Jaime Penabad / Carlos Vázquez / 
Palabras Clave: Fuzzy Logic Programming - Herbrand Model - Similarity Relations

2 - FuzzyDES: Fuzzifying DES (Trabajo en progreso)

This paper describes a system implementation of a fuzzy deductive database. Concepts supporting the fuzzy logic programming system BPL are translated into the deductive database system DES. We develop a version of fuzzy Datalog as its query language, where programs and queries are compiled to the DES core Datalog language. Weak unification and weak SLD resolution are adapted to this setting, and extended to allow rules with truth degree annotations. We provide a public implementation in Prolog which is open-source, multiplatform, portable, and in-memory. A database example for a recommender system is used to illustrate some of the features of the system.

Autores: Pascual Julián-Iranzo / Fernando Sáenz-Pérez / 
Palabras Clave: Bousi~Prolog - Datalog Educational System - Fuzzy Datalog - Fuzzy Logic Programming - FuzzyDES

3 - Integrating WordNet into Bousi~Prolog (Work in Progress)

In this paper we provide techniques to integrate WordNet into a Fuzzy Logic Programming System. Because WordNet relates words but does not give graded information of the relation between them, we have implemented standard similarity measures and new directives that allow us to generate the proximity equations linking two words with an approximation degree. Proximity equations are the key syntactic structures that, in addition to a weak unification algorithm, make possible a flexible query answering process in this kind of programming languages.

Autores: Pascual Julian-Iranzo / Fernando Saenz-Perez / 
Palabras Clave: Fuzzy Logic Programming - Similarity Measures - WordNet

4 - A System implementing Fuzzy Hypothetical Datalog

This paper presents a system implementing a novel addition to a fuzzy deductive database: hypothetical queries. Such queries allow users to dynamically make assumptions on a given database instance, either by adding or removing data, without changing the instance. Further, since a fuzzy database includes fuzzy relations, these relations can also be changed with assumptions. This ability for dynamic change seamlessly enables writing “what-if” applications such as decision-support systems. Here, the new language Fuzzy Hypothetical Datalog is presented, along with an operational semantics and stratified inference. It has been implemented in a working system DES readily available on-line.IEEE International Conference on Fuzzy Systems (FUZZ-IEEE), 2020, pp. 1-8, doi: 10.1109/FUZZ48607.2020.9177715.

Autores: Pascual Julian-Iranzo / Fernando Saenz-Perez / 
Palabras Clave: Datalog - Deductive databases - Fuzzy Logic - Hypothetical Reasoning

5 - Seeking a Safe and Efficient Similarity-based Unfolding Rule

The unfolding transformation has been widely used in many declarative frameworks for improving the efficiency of programs. Inspired by our previous experiences in fuzzy logic languages not dealing with similarity relations, in this work we try to adapt such operation to the so-called FASILL language (acronym of «Fuzzy Aggregators and Similarity Into a Logic Language») which has been developed in our research group for coping with implicit/explicit truth degree annotations, a great variety of connectives and unification by similarity. The traditional unfolding transformation is based on the application of unifiers on the heads and computational steps on the bodies of program rules. However, when considering similarity relations, the premature generation and application of weak (similarity-based) unifers at unfolding time could destroy the correctness of the transformation. In this paper we study how to avoid this risk by compiling what we call similarity constraints on transformed rules, whose further evaluation is delayed at running time. Moreover, our technique minimizes the size and number of occurrences of such constructs in transformed programs to gain efficiency while preserving semantics.

Autores: Pascual Julian-Iranzo / Gines Moreno / José Antonio Riaza Valverde / 
Palabras Clave: Fuzzy Logic Programming - Similarity Relations - Unfolding

6 - Planning for an Efficient Implementation of Hypothetical Bousi~Prolog

This paper explores the integration of hypothetical reasoning into an efficient implementation of the fuzzy logic language Bousi~Prolog. To this end, we first analyse what would be expected from a logic inference system, equipped with what is called embedded implication, to model solving goals with respect to assumptions. We start with a propositional system and incrementally build more complex systems and implementations to satisfy the requirements imposed by a system like Bousi~Prolog. Finally, we propose an inference system, operational semantics, and the translation function to generate efficient Prolog programs from Bousi~Prolog programs. This paper has been presented at ICLP’21 and published in TPLP 21 (5), pp. 680-697. DOI: https://doi.org/10.1017/S1471068421000405

Autores: Pascual Julián-Iranzo / Fernando Saenz-Perez / 
Palabras Clave: Bousi~Prolog - Fuzzy Logic Programming - Fuzzy Prolog - Hypothetical Reasoning - System Implementation

7 - Conversion of the Spanish WordNet databases into a Prolog-readable format

WordNet is a lexical database for English that is supplied in a variety of formats, including one compatible with the Prolog programming language. Given the success and usefulness of WordNet, wordnets of other languages have been developed, including Spanish. The Spanish WordNet does not provide a version compatible with Prolog. This work aims to fill that gap by translating a version of the Spanish WordNet into a Prolog-compatible format. Thanks to this translation, we would obtain a set of Spanish lexical databases that would allow us to access that information using declarative techniques and the deductive capabilities of the Prolog language. Also, this work would facilitate the development of other programs to analyze the obtained information.

Autores: Pascual Julián-Iranzo / Germán Rigau / Fernando Sáenz-Pérez / Pablo Velasco-Crespo / 
Palabras Clave: Computation and Language - Logic Programming - Prolog - WordNet