Pascual Julián-Iranzo
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Pascual Julián-Iranzo has a total of 34 co-authors. Here are the top co-authors by number of shared publications:
- Clemente Rubio-Manzano
Department of Information Systems, University of the Bío-Bío, Concepcion 4030000, Chile
13 shared publications - Ginés Moreno
UCLM, Dept Comp Syst, Albacete 02071, Spain
12 shared publications - Fernando Sáenz-Pérez
Department of Software Engineering and Artificial Intelligence, Universidad Complutense de Madrid, Madrid, Spain
6 shared publications - Jesús Medina
University of Cadiz, Cadiz, Spain
6 shared publications - Manuel Ojeda-Aciego
Departamento de Matemática Aplicada, Universidad de Málaga, 29071 Málaga, Spain
6 shared publications Jaime Penabad
Dept. of Mathematics, U. of Castilla-La Mancha
5 shared publications
Latest Publications
- Open Access
- 17 October 2024
- Published by Springer Nature in Artificial Intelligence Review
- Vol. 57 (12) , 1-30
An efficient propositional system for Abductive Logic Programming
Abductive logic programming (ALP) extends logic programming with hypothetical reasoning by means of abducibles, an extension able to handle interesting problems, such as diagnosis, planning, and verification with formal methods. Implementations of this extension have been using Prolog meta-interpreters and Prolog programs with Constraint Handling Rules (). While the latter adds a clean and efficient interface to the host system, it still suffers in performance for large programs. Here, the concern is to obtain a more performant implementation of the system following a compiled approach. This paper, as a first step in this long term goal, sets out a propositional ALP system following , eliminating the need for and achieving better performance.
- 17 October 2024
- Published by Springer Nature in Artificial Intelligence Review
- Vol. 57 (12) , 1-30
Open AccessAn efficient propositional system for Abductive Logic Programming
Abductive logic programming (ALP) extends logic programming with hypothetical reasoning by means of abducibles, an extension able to handle interesting problems, such as diagnosis, planning, and verification with formal methods. Implementations of this extension have been using Prolog meta-interpreters and Prolog programs with Constraint Handling Rules (). While the latter adds a clean and efficient interface to the host system, it still suffers in performance for large programs. Here, the concern is to obtain a more performant implementation of the system following a compiled approach. This paper, as a first step in this long term goal, sets out a propositional ALP system following , eliminating the need for and achieving better performance.
- 21 August 2024
- Published by Springer Nature in Language Resources and Evaluation
- Vol. 59 (2) , 1631-1657
Conversion of the Spanish WordNet databases into a Prolog-readable format
- 21 August 2024
- Published by Springer Nature in Language Resources and Evaluation
- Vol. 59 (2) , 1631-1657
Conversion of the Spanish WordNet databases into a Prolog-readable format
- 27 September 2023
- Published by Elsevier in International Journal of Approximate Reasoning
- Vol. 163
Seeking a safe and efficient similarity-based unfolding rule
- 27 September 2023
- Published by Elsevier in International Journal of Approximate Reasoning
- Vol. 163
Seeking a safe and efficient similarity-based unfolding rule
- 22 September 2022
- Published by Elsevier in Expert Systems with Applications
- Vol. 213
Bousi∼Prolog: Design and implementation of a proximity-based fuzzy logic programming language
- 22 September 2022
- Published by Elsevier in Expert Systems with Applications
- Vol. 213
Bousi∼Prolog: Design and implementation of a proximity-based fuzzy logic programming language
- 1 September 2021
- Published by Cambridge University Press (CUP) in Theory and Practice of Logic Programming
- Vol. 21 (5) , 680-697
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 programmes from Bousi∼Prolog programmes.
- 1 September 2021
- Published by Cambridge University Press (CUP) in Theory and Practice of Logic Programming
- Vol. 21 (5) , 680-697
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 programmes from Bousi∼Prolog programmes.
- 1 May 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Fuzzy Systems
- Vol. 29 (5) , 1238-1251
Proximity-Based Unification: An Efficient Implementation Method
- 1 May 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Fuzzy Systems
- Vol. 29 (5) , 1238-1251
Proximity-Based Unification: An Efficient Implementation Method
- 3 March 2021
- Published by Cambridge University Press (CUP) in Theory and Practice of Logic Programming
- Vol. 21 (2) , 264-282
Implementing WordNet Measures of Lexical Semantic Similarity in a Fuzzy Logic Programming System
This paper introduces techniques to integrate WordNet into a Fuzzy Logic Programming system. Since WordNet relates words but does not give graded information on the relation between them, we have implemented standard similarity measures and new directives allowing the proximity equations linking two words to be generated with an approximation degree. Proximity equations are the key syntactic structures which, in addition to a weak unification algorithm, make a flexible query-answering process possible in this kind of programming language. This addition widens the scope of Fuzzy Logic Programming, allowing certain forms of lexical reasoning, and reinforcing Natural Language Processing (NLP) applications.
- 3 March 2021
- Published by Cambridge University Press (CUP) in Theory and Practice of Logic Programming
- Vol. 21 (2) , 264-282
Implementing WordNet Measures of Lexical Semantic Similarity in a Fuzzy Logic Programming System
This paper introduces techniques to integrate WordNet into a Fuzzy Logic Programming system. Since WordNet relates words but does not give graded information on the relation between them, we have implemented standard similarity measures and new directives allowing the proximity equations linking two words to be generated with an approximation degree. Proximity equations are the key syntactic structures which, in addition to a weak unification algorithm, make a flexible query-answering process possible in this kind of programming language. This addition widens the scope of Fuzzy Logic Programming, allowing certain forms of lexical reasoning, and reinforcing Natural Language Processing (NLP) applications.
- 1 July 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-8
An Efficient Proximity-based Unification Algorithm⋆
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.
- 1 July 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-8
An Efficient Proximity-based Unification Algorithm⋆
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.
- 1 July 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-8
FASILL: Fuzzy Correct Answers and Soundness⋆
The FASILL programming language (acronym of "Fuzzy Aggregators and Similarity Into a Logic Language") combines a weak unification algorithm, based on similarity relations, along with a rich repertoire of fuzzy connectives and aggregators, whose truth functions can be defined on a complete lattice. In this paper, after recalling the operational semantics of this language, we provide a notion of fuzzy correct answer for a program and a goal and we prove the soundness of FASILL for this operational semantics and the notion of correct answer introduced.
- 1 July 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-8
FASILL: Fuzzy Correct Answers and Soundness⋆
The FASILL programming language (acronym of "Fuzzy Aggregators and Similarity Into a Logic Language") combines a weak unification algorithm, based on similarity relations, along with a rich repertoire of fuzzy connectives and aggregators, whose truth functions can be defined on a complete lattice. In this paper, after recalling the operational semantics of this language, we provide a notion of fuzzy correct answer for a program and a goal and we prove the soundness of FASILL for this operational semantics and the notion of correct answer introduced.
- 16 February 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Fuzzy Systems
- Vol. 26 (5) , 2634-2648
A Fuzzy Datalog Deductive Database System
This paper describes a proposal for a deductive database system with fuzzy Datalog as its query language. Concepts supporting the fuzzy logic programming system Bousi~Prolog are tailored to the needs of the deductive database system DES. We develop a version of fuzzy Datalog where programs and queries are compiled to the DES core Datalog language. Weak unification and weak SLD resolution are adapted for 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, featuring a graphical user interface. A distinctive feature of this system is that, unlike others, we have formally demonstrated that our implementation techniques fit the proposed operational semantics. We also study the efficiency of these implementation techniques through a series of detailed experiments. Moreover, a database example for a recommender system is used to illustrate some of the features of the system and its usefulness.
- 16 February 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Fuzzy Systems
- Vol. 26 (5) , 2634-2648
A Fuzzy Datalog Deductive Database System
This paper describes a proposal for a deductive database system with fuzzy Datalog as its query language. Concepts supporting the fuzzy logic programming system Bousi~Prolog are tailored to the needs of the deductive database system DES. We develop a version of fuzzy Datalog where programs and queries are compiled to the DES core Datalog language. Weak unification and weak SLD resolution are adapted for 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, featuring a graphical user interface. A distinctive feature of this system is that, unlike others, we have formally demonstrated that our implementation techniques fit the proposed operational semantics. We also study the efficiency of these implementation techniques through a series of detailed experiments. Moreover, a database example for a recommender system is used to illustrate some of the features of the system and its usefulness.