Fuzzy logic programming

doi:10.1016/S0165-0114(01)00106-3

Fuzzy Sets and Systems

Volume 124, Issue 3, 16 December 2001, Pages 361-370

https://doi.org/10.1016/S0165-0114(01)00106-3 Get rights and content

Abstract

In this paper we consider the theory of fuzzy logic programming without negation. Our results cover logical systems with a wide variety of connectives ranging from t-norm and conorms, through conjunctors and disjunctors and their residuals to aggregation operators. Rules of our programs are many valued implications. We emphasize, that in contrast to other approaches, our logic is truth functional, i.e. according to P. Hájek, we work in fuzzy logic in narrow sense. We prove the soundness and the completeness of our formal model. We deal with applications to threshold computation, abduction, fuzzy unification based on similarity. We show that fuzzy unification based on similarities has applications to fuzzy databases and flexible querying.

References (28)

M.H. van Emden
Quantitative deduction and its fixpoint theory
J. Logic Programming
(1986)
E.H. Shortliffe et al.
A model of inexact reasoning in medicine
Math. Biosci.
(1975)
L.A. Zadeh
Fuzzy sets
Inform. and Control
(1965)
D. Dubois, J. Lang, H. Prade, Fuzzy sets in approximate reasoning, Part 2: Logical approaches, in: I.B. Turksen, D....
K. Goedel, Zum intuitionistischen Aussagenkalkuel. Anzeiger Akademie der Wissenschaften Wien, Math.- Naturwissensch....
S. Gottwald
Mehrwertige Logik
(1988)
S. Gottwald
Fuzzy Sets and Fuzzy Logic
(1993)
M.M. Gupta, J. Qi, Theory of T-norms and fuzzy inference methods, in: M.M. Gupta (Ed.), Fuzzy Logic and Uncertainty...
P. Hájek
Metamathematics of Fuzzy Logic
(1998)
K. Klawonn et al.
logic based Prolog
Mathware Soft Comput.
(1994)

D.Y. Li et al.

A Fuzzy Prolog Database System

(1990)

J.W. Lloyd

Foundation of Logic Programming

(1987)

J. Łukasiewicz

Selected Works

(1970)

M. Mukaidono, H. Kikuchi, Foundations of fuzzy logic programming, in: P.-Z. Wang, K.-F. Loe (Eds.), Between Mind and...

Cited by (198)

Some properties of substitutions in the framework of similarity relations
2023, Fuzzy Sets and Systems
A substitution is a mapping from variables to terms. There is a consensus in the Logic Programming community that the work with substitutions is a source of errors due to their poor algebraic properties. This problem increases when we manipulate substitutions in the framework of similarity relations, where some classical concepts have more complex definitions and the intuition of the result of the operations involving them is easily lost.
In this work we analyze some algebraic properties of substitutions in the framework of similarity relations. Specifically, we study the lattice structure of the set of idempotent substitutions with the definition of the weak parallel composition and weak parallel factorization operations, acting as the join and meet of the lattice. Also we relate these operations with the classical operation of composition of substitutions. The aim is to provide fuzzy logic programming researchers with reasoning tools with richer properties that facilitate formal proofs and, even, able to define compositional and parallel semantics.
Bousi∼Prolog: Design and implementation of a proximity-based fuzzy logic programming language
2023, Expert Systems with Applications
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.
Measures of inclusion and entropy based on the φ-index of inclusion
2021, Fuzzy Sets and Systems
Surprisingly, despite that fuzzy sets were introduced more than fifty years ago, there is not consensus yet about how to extend the notion of inclusion in such a framework. Recently, alternatively to previous methods in the literature, we introduced an approach in which we make use of the so-called φ-index of inclusion. This approach has a main difference with respect to previous ones: the degree of inclusion is identified with a function instead of with a value in $[0, 1]$ , although such a feature makes it difficult to compare the φ-index of inclusion with existing axiomatic approaches concerning measures of inclusion. This is the reason why in this paper we define two different and natural measures of inclusion by means of the φ-index of inclusion and, then, show that both measures satisfy some standard axiomatic approaches about measures of inclusion in the literature. In addition, taking into account the relationship of fuzzy entropy with Young axioms for measures of inclusion, we present also a measure of entropy based on the φ-index of inclusion that is in accordance with the axioms of De Luca and Termini.
The Fuzzy Logic Programming language FASILL: Design and implementation
2020, International Journal of Approximate Reasoning
Citation Excerpt :
In relation to all this, Fig. 12a is very revealing, because it graphically shows the increasing price that has to be paid to include various fuzzy features into a logic programming language. Two research lines are recognized in FLP, the one that modifies the classical resolution procedure, replacing it by a fuzzy resolution mechanism [25,46,58,49,74] and the one that extends the Selection-function driven Linear resolution for Definite clauses (SLD resolution) principle [13,44] replacing its classical unification algorithm by a fuzzy unification algorithm. When the fuzzy unification algorithm is weakened using a similarity relation this approach is usually named Similarity-based Logic Programming [14,15,47,65].
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 work, we want to provide a unified view of the fundamental concepts and ideas that inspired its construction, jointly with the implementation techniques that made it possible. We detail the implementation of the operational semantics and we describe the overall structure of the FASILL system. The FASILL language is well-suited for a wide range of applications and, specifically, it can help the development of knowledge based systems where to deal with uncertainty is important. After ten years designing and implementing fuzzy logic systems, this work culminates and agglutinates the experience acquired in our research group on the development of this kind of modern programming languages.
Extended multi-adjoint logic programming
2020, Fuzzy Sets and Systems
Extended multi-adjoint logic programming arises as an extension of multi-adjoint normal logic programming where constraints and a special type of aggregator operator have been included. The use of this general aggregator operator permits to consider, for example, different negation operators in the body of the rules of a logic program. We have introduced the syntax and the semantics of this new paradigm, as well as an interesting mechanism for obtaining a multi-adjoint normal logic program from an extended multi-adjoint logic program. This mechanism will allow us to establish technical properties relating the different stable models of both logic programming frameworks. Moreover, it makes possible that the already developed and future theory associated with stable models of multi-adjoint normal logic programs can be applied to extended multi-adjoint logic programs.
A bibliometric analysis of aggregation operators
2019, Applied Soft Computing Journal
Aggregation operators consist of mathematical functions that enable the combining and processing of different types of information. The aim of this work is to present the main contributions in this field by a bibliometric review approach. The paper employs an extensive range of bibliometric indicators using the Web of Science (WoS) Core Collection and Scopus datasets. The work considers leading journals, articles, authors, institutions countries and patterns. This paper highlights that Xu is the most productive author and Yager is the most influential author in the field. Likewise, China is leading the field with many new researchers who have entered the field in recent years. This discipline has been strengthening to create a unique theory and will continue to expand with many new theoretical developments and applications.

View all citing articles on Scopus

^☆: Research supported by grants VEGA 1/7557/20 and GAČR 201/00/1489.

View full text

Fuzzy logic programming☆

Abstract

J. Logic Programming

Math. Biosci.

Inform. and Control

Mehrwertige Logik

Fuzzy Sets and Fuzzy Logic

Metamathematics of Fuzzy Logic

logic based Prolog

Mathware Soft Comput.

A Fuzzy Prolog Database System

Foundation of Logic Programming

Selected Works