Professional Documents
Culture Documents
Textbook Interactions Between Computational Intelligence and Mathematics Part 2 Laszlo T Koczy Ebook All Chapter PDF
Textbook Interactions Between Computational Intelligence and Mathematics Part 2 Laszlo T Koczy Ebook All Chapter PDF
https://textbookfull.com/product/trends-in-mathematics-and-
computational-intelligence-maria-eugenia-cornejo/
https://textbookfull.com/product/artificial-intelligence-
foundations-of-computational-agents-david-l-poole/
https://textbookfull.com/product/computational-intelligence-
theories-applications-and-future-directions-volume-i-nishchal-k-
verma/
Computational Intelligence Theories Applications and
Future Directions Volume II ICCI 2017 Nishchal K. Verma
https://textbookfull.com/product/computational-intelligence-
theories-applications-and-future-directions-volume-ii-
icci-2017-nishchal-k-verma/
https://textbookfull.com/product/lake-biwa-interactions-between-
nature-and-people-2nd-edition-hiroya-kawanabe/
https://textbookfull.com/product/computational-intelligence-and-
sustainable-systems-intelligence-and-sustainable-computing-h-
anandakumar/
https://textbookfull.com/product/recent-studies-on-computational-
intelligence-doctoral-symposium-on-computational-intelligence-
dosci-2020-ashish-khanna/
https://textbookfull.com/product/computational-intelligence-and-
its-applications-abdelmalek-amine/
Studies in Computational Intelligence 794
László T. Kóczy
Jesús Medina-Moreno
Eloísa Ramírez-Poussa Editors
Interactions Between
Computational
Intelligence and
Mathematics Part 2
Studies in Computational Intelligence
Volume 794
Series editor
Janusz Kacprzyk, Polish Academy of Sciences, Warsaw, Poland
e-mail: kacprzyk@ibspan.waw.pl
The series “Studies in Computational Intelligence” (SCI) publishes new develop-
ments and advances in the various areas of computational intelligence—quickly and
with a high quality. The intent is to cover the theory, applications, and design
methods of computational intelligence, as embedded in the fields of engineering,
computer science, physics and life sciences, as well as the methodologies behind
them. The series contains monographs, lecture notes and edited volumes in
computational intelligence spanning the areas of neural networks, connectionist
systems, genetic algorithms, evolutionary computation, artificial intelligence,
cellular automata, self-organizing systems, soft computing, fuzzy systems, and
hybrid intelligent systems. Of particular value to both the contributors and the
readership are the short publication timeframe and the world-wide distribution,
which enable both wide and rapid dissemination of research output.
Eloísa Ramírez-Poussa
Editors
Interactions Between
Computational Intelligence
and Mathematics Part 2
123
Editors
László T. Kóczy Jesús Medina-Moreno
Department of Information Technology Department of Mathematics,
Széchenyi István University Faculty of Science
Győr, Hungary University of Cádiz
Cádiz, Spain
and
Eloísa Ramírez-Poussa
Budapest University of Technology Department of Mathematics,
and Economics Faculty of Economic and
Budapest, Hungary Business Sciences
University of Cádiz
Cádiz, Spain
This Springer imprint is published by the registered company Springer Nature Switzerland AG
The registered company address is: Gewerbestrasse 11, 6330 Cham, Switzerland
Preface
The latest technological advances in handling very complex problems make nec-
essary the combination of mathematical techniques with computational intelligence
tools in order to solve these various problems emerging in many different areas.
Indeed, important funding programs are devoted to the development of new
instruments to deal with the challenges that we face in the current technological age.
Without doubt, research topics associated with the interaction between computa-
tional intelligence and mathematics play a key role at presence. In this special issue,
engineers, scientists, and mathematicians provide appealing contributions focused
on the solution of meaningful and realistic problems, which connect those two
research areas. This contributed volume presents a series of novel solutions for such
problems.
Chapter “On the Incorporation of Interval-Valued Fuzzy Sets into the Bousi-
Prolog System: Declarative Semantics, Implementation and Applications” by
Clemente Rubio-Manzano and Martín Pereira-Fariña is focused on the design and
the implementation of an interval-valued fuzzy (IVF) logic language and its
incorporation into the Bousi-Prolog system. First of all, a detailed study on the
syntax and the semantics corresponding to the IVF logic language is presented. The
formalization of the notion of least IVF Herbrand model for IVF programs plays a
key role in this research. From the implementation point of view, the main chal-
lenge is now to add an IVFSs’ arithmetic to the Warren Abstract Machine based on
similarity. By means of potential applications, the authors show that the IVF logic
programming language thus developed is very useful in modeling the uncertainty
and imprecision of the knowledge related to lexical resources.
Chapter “The Existence of Generalized Inverses of Fuzzy Matrices” by
Miroslav Ćirić and Jelena Ignjatović provides a novel approach for testing the
existence of different generalized inverses of fuzzy matrices whose entries belong to
a complete residuated lattice. An iterative method to compute these greatest gen-
eralized inverses is also proposed. In particular, this iteration ends in a finite number
of steps when the considered fuzzy matrices have their entries in a Heyting algebra.
Moreover, the problem of representing generalized inverses as a solution for linear
equation systems is discussed.
v
vi Preface
questions, about a new measure on interactivity between fuzzy numbers, called the
“weighted possibilistic correlation coefficient,” were left unanswered. This paper
proves that when the marginal possibility distributions have equal, strictly
increasing or strictly decreasing membership functions, the lower limit of the
possibilistic correlation coefficient is −1. In addition, they also present an extension
of these results to the general case for fuzzy and quasi-fuzzy numbers. It is
important to highlight that the results presented in this work can be very useful in
time-series models and fuzzy statistics.
Chapter “A Generalized Net Model for the Coordination and Synchronization of
Human and Computer-Based Expert Type Decision Support Activities” by
Evdokia Sotirova, Janusz Kacprzyk, Krassimir Atanassov, and Eulalia Szmidt is
framed in the area of decision making. In this work, the authors introduce a new
approach for modeling and supporting a special class of multi-agent decision
making. The generalized net model of a decision-making process involves the
human agents (experts), some decision-making tools, and techniques exemplified
by algorithms, procedures, decision support systems, and expert systems.
Therefore, they prove that the use of the tools and techniques of the generalized nets
can organize, coordinate, and synchronize both the work of experts and
decision-making tools in order to obtain results in the most adequate, effective, and
efficient way.
Chapter “Wavelet Analysis and Structural Entropy Based Intelligent
Classification Method for Combustion Engine Cylinder Surfaces” by
Szilvia Nagy and Levente Solecki develops an intelligent fuzzy classification
method, based on structural entropy and wavelet analysis, for characterizing
combustion engine cylinder surfaces. From scanned images of the surfaces, the
proposed method is capable of identifying whether a surface is either worn or new
and if such surface can be helpful to establish the grade of wear. Specifically,
structural entropies are used to determine the general slope of the shape of the
surface. Concerning the wavelet analysis, this technique is employed to separate the
scale behavior patterns of the surfaces. The authors conclude that the developed
method can distinguish, with a good accuracy, both a worn surface scanned by a
contact stylus and a new surface scanned by an optical scanner on a silicone replica.
We wish to thank the authors for their excellent and inspiring contributions and
anonymous peer reviewers whose insight and suggestions have helped a lot to
improve the contributions. And last but not least, we wish to thank
Dr. Tom Ditzinger, Dr. Leontina di Cecco, and Mr. Holger Schaepe for their
dedication and help to implement and finish this large and ambitious publication
project.
ix
x Contents
C. Rubio-Manzano (B)
Department of Information Systems, University of the Bío-Bío, Concepción, Chile
e-mail: clrubio@ubiobio.cl
M. Pereira-Fariña
Centre for Argument Technology, University of Dundee, QMB Balfour Street,
Dundee DD14HN, UK
e-mail: mzpereirafarina@dundee.ac.uk; martin.pereira@usc.es
M. Pereira-Fariña
Departamento de Filosofía e Antropoloxía, Universidade de Santiago de
Compostela, Praza de Mazarelos, 15782 Santiago de Compostela, Spain
2 Preliminary Concepts
IVFSs are a fuzzy formalism based on two membership mappings instead of a single
one, like in standard FSs. Each one of these membership functions are called, lower
membership function and upper membership function. Both are established on a
universe of discourse X , and they map each element from X to a real number in the
[0, 1] interval, where the elements of X belongs to A according to an interval.
As can be observed in Definition 1, those intervals are included in [0, 1] and closed
at both ends. On the other hand, some arithmetic operations on interval-numbers have
been recalled since they are useful in operating on cardinalities of IVFSs. Let a =
[a, a], b = [b, b] be intervals in R, and r ∈ R+. The arithmetic operations ’+’, ’−’,
’·’ and power are defined as follows:
a, a + b, b = a + b, a + b ; (1)
a, a − b, b = a − b, a − b ; (2)
a, a · b, b = min(a · b, a · b, a · b, a · b), max(a · b, a · b, a · b, a · b) ;
(3)
r r r
a, a = a , a for non-negative a, a (4)
4 C. Rubio-Manzano and M. Pereira-Fariña
The operations of union and intersection for IVFSs are defined by triangular
norms. Let A, B be IVFSs in X , t a t-norm and s a t-conorm. The union of A and
B is the interval-valued fuzzy set A ∪ B with the membership function: μ A∪B (x) =
[s(μ A (x), μ B (x)), s(μ A (x), μ B (x))]. The intersection of A and B is the IVFSs A∩B
in which μ A∩B (x) = [t (μ A (x), μ B (x)), t (μ A (x), (μ B (x))]. Thus, de Morgan’s laws
for IVFSs A,B in X are: (A ∪ B)c = Ac ∩ B c and (A ∩ B)c = Ac ∪ B c .
Let L be a lattice of intervals in [0, 1] that satisfies:
Also by definition
Hence, 0 L = [0, 0] and 1 L = [1, 1] are the smallest and the greatest elements in L.
Q, [α, α] (9)
A ← Q, [β, β] (10)
A, T ([α, α], [β, β]] (11)
On the Incorporation of Interval-Valued Fuzzy Sets into the Bousi-Prolog System … 5
If we have (9) and (10), we can deduce (11) with T a t-norm defined on the lattice
L([0, 1]).
The design of a programming language involves three main steps. Firstly, the defini-
tion of the syntax; secondly, the elaboration of a formal study of its semantics; and
thirdly, an implementation of the system. In order to address the tasks related with
syntax and semantics, we will follow the guidelines established in [19, 20]1 ; for the
implementation task, we will follow the guidelines detailed in [16].
3.1 Sintax
Definition 6 Let L be a first order language. The Herbrand base BL for L is the set
of all ground atoms which can be formed by using predicate symbols from L with
ground terms from the Herbrand universe as arguments.
Theorem 1 Let be an Interval-valued fuzzy program and suppose has a [λ, λ]-
model. Then has a Herbrand [λ, λ]-model.
Proof First, let us suppose that A is a logical consequence for at level [λ, λ],
then, by definition, for any interval-valued fuzzy interpretation I if I is [λ, λ]-model
for , it is a [λ, λ]-model for A. Moreover, by the Theorem 1, there must exist I’
which being an interval-valued fuzzy Herbrand model for at level [λ, λ], it is a
[λ, λ]-model for A. This establishes the first side of the argument. Now, we have
that for every interpretation I, if I is a Herbrand model for at level [λ, λ], it is
8 C. Rubio-Manzano and M. Pereira-Fariña
In this section, we give a deeper characterisation of the least Herbrand model for an
interval-valued fuzzy program using fixpoint concepts.
This is possible because of each interval-valued fuzzy program has associated a
complete lattice of interval-valued fuzzy Herbrand interpretations and we can define
a continuous operator on that lattice. This allows us to provide a constructive vision
of the meaning of a program by defining an immediate consequences operator and
to construct the least Herbrand model by means of successive applications.
Definition 13 (Fixpoint Characterization of the least Herbrand model) Let be an
interval-valued fuzzy program, the mapping O : 2 BL → 2 BL is defined as follows.
Let I be an interval-valued fuzzy Herbrand interpretation, then:
O = {A ∈ BL : A ← B1 , . . . , Bn [α, α] is a ground instance of a clause in and
I(Bi ) ≥ [α, α] ≥ [λ, λ] where I(A) ≥ in f (I(B1 , . . . , Bn ))}
As in the case of classical logic programming, interval-valued fuzzy Herbrand
interpretations which are models can be characterised in terms of the operator O.
Theorem 3 Let be an interval-valued fuzzy program. Let I be an interval-valued
fuzzy Herbrand interpretation of . I is [λ, λ]-model for if and only if O(I) ⊆ I.
Proof I is a [λ, λ]-model for if and only if for all clause C in then I(C) ≥ [λ, λ].
Therefore, it is fulfilled if and only if for every variable assignment ϑ, I(Cϑ) ≥ [λ, λ].
Therefore, supposing without loss of generality that C ≡ A ← B1 , . . . , Bn [α, α]
then I(A ← B1 , . . . , Bn ϑ) ≥ [λ, λ], by the properties of the t-norm minimun
I(B1 , . . . , Bn ϑ) ≥ [α, α] ≥ [λ, λ]min what implies that I(B1 , . . . , Bn ϑ) ⊆ O and
hence I(Aϑ) ⊆ O(I), again by the properties of the t-norm minimun I(Aϑ) ≥
in f (I(B1 ϑ), . . . , I(Bn ϑ)) what implies that O(I) ⊆ I
Now we are ready to demonstrate the main theorem of this subsection, but first
we recall the following results from fixpoint theory.
Theorem 4 (FixPoint Theorem) Let L , ≤ be a complete lattice and O : L → L
be a monotonic mapping. Then O has a least fixpoint l f p(O) = in f {x | O(x) =
x} = in f {x | T (x) ≤ x}.
Proposition 3 Let L , ≤ be a complete lattice and O : L → L be a continuous
mapping. Then l f p(O) = O ↑ ω.
Proof See [19]
Theorem 5 Let be an interval-valued fuzzy definite program. Then M =
T
l f p(O ) = O ↑ →.
Proof M is the least model which is the intersection of any [λ, λ]-model for .
As the lattice of interval-valued fuzzy Herbrand models is a complete one, then we
can use the Theorem 4, the Proposition 3 and the Theorem 3. Applying them and the
continuity of O establishes the theorem.
10 C. Rubio-Manzano and M. Pereira-Fariña
Example 5 Given the program of Example 3, the least Herbrand model for :
O ↑ 0 = I⊥ ;
O ↑ 1 = O(O ↑ 0) = { p(a), [0, 1] , p(b), [0, 1] , q(a), [0.8, 0.9] ,
q(a), [0.7, 0.8] }
O ↑ 2 = O(O ↑ 1) = { p(a), [0.8, 0.9] , p(b), [0.7, 0.8] , q(a), [0.8, 0.9] ,
q(a), [0.7, 0.8] }
O ↑ 3 = O ↑ 2.
Therefore, as the fixpoint is reached at the next item: M = O ↑ 2.
3.5 Implementation
In this section, we briefly explain how interval-valued fuzzy sets are incorporated
into the Bousi-Prolog system.2 Here, we describe the structure and main features
of its abstract machine. It was created as extension of the SWAM for the execu-
tion of Bousi-Prolog programs. We have appropriately modified the compiler, some
machine instructions and SWAM structures in order to trigger the interval-valued
fuzzy resolution. It is worth noting that, to the best of our knowledge, this is the first
SWAM implementation that supports interval-valued fuzzy resolution.
A mandatory step to achieve this result is to include a new data structure
into the architecture for computing with interval-valued fuzzy sets. This data
structure has been implemented by using a class called IntervalFS which is
formed by two private attributes of double type: upper_limit, lower_limit. We
define the public method constructor IntervalFS(double ll,double lu)
and the four methods (sets and gets): double getUpperLimit(); double
getLowerLimit(); void setUpperLimit(double v); void
setLowerLimit(double v). Additionally, we overwrite both the toString and
the equals methods in the usual way. Finally, methods for adding, substracting
and computing minimum of interval valued fuzzy set are implemented: IntervalFS
add(IntervalFS a, IntervalFS b); IntervalFS substract(IntervalFS a, IntervalFS b);
IntervalFS min(IntervalFS a, IntervalFS b).
The following example illustrates the new features of the SWAM enhanced with
IVFSs.
Example 6 Let us suppose that we want to represent the following knowledge: a
football player is good when he is fast, tall and coordinated. We know a particular
player that is fast, quite tall but he is not very coordinated. Thus, is he a good player?
Answering this question and in this scenario, the linguistic expression “is not very
coordinate” could be represented by the fact “coordinate(a) [0.2, 0.4]”, the linguistic
term “fast” could be represented by the fact “fast(a) [0.9, 1.0]” and “quite tall” could
be represented by the fact “tall(a) [0.8, 0.9]”. A possible solution by employing a
Bousi-Prolog program is described as follows:
% FACTS
coordinate(a) [0.2,0.4]
fast(a) [0.9,1.0]
tall(a )[0.8,0.9]
% RULES
good_player(X):-tall(X), fast(X), coordinate(X)
The SWAM enhanced with IVFSs allows us to obtain the answer: “X = a with
[0.2,0.4]”. The SWAM code generated for this program is as follows:
The first instruction to be executed is the one labelled with the key “query”, hence
the execution starts at the position 20 with a degree D = [1.0, 1.0] (which is fixed in
the instruction tr ust_me). After that, from line 20 to line 23 the query is launched
and the variable X is created (cr eate_variable instruction). After that from line
00 to line 04 the first subgoal (coordinate(X)) is launched, then the execution goes
to line 11 and the unification with the term “coordinate(a)” is produced (from line
11 to 13) ( put_value and get_constant instructions), a new approximation degree
is established D = min([1.0, 1.0], [0.2, 0.4]) (tr ust_me instruction), as these terms
unify the following subgoal ( f ast (X ), line 05 and from line 14 to line 16) is launched
with an approximation degree D = min([0.2, 0.4], [0.9, 1.0]); as the terms unify,
then the following subgoal (tall(X ), line 08 and from line 17 to 19) is launched with
an approximation degree D = min([0.2, 0.4], [0.9, 1.0]). Finally, the assignation
X = a with [0.2, 0.4] is produced.
We have implemented a limit to the expansion of the search space in a compu-
tation by what we called a “λ-cut for IVFSs”. When the LambdaCutIVFS flag is
set to a value different than [0.0, 0.0], the weak unification process fails if the com-
puted approximation degree goes below the stored LambdaCutIVFS value. There-
fore, the computation also fails and all possible branches starting from that choice
point are discarded. By default the LambdaCutIVFS value is [0.0, 0.0]. However,
the lambda cut flag can be set to a different value by means of a λ-cut directive: “:-
lambdaCutIVFS(N).”, where N is an interval between [0.0, 0.0] and [1.0, 1.0]. For
example, a λ-cut of [0.5, 0.5] could be established by using the following directive:
“:-lambdaCutIVFS ([0.5, 0.5])”.
4 Applications
The main realms for the application of the IVFSs programming language described
in this paper are those which involve natural language semantics processing. In this
section, we will discuss two of them: linguistic knowledge modelling and proximity-
based logic programming using linguistic resources.
On the Incorporation of Interval-Valued Fuzzy Sets into the Bousi-Prolog System … 13
suitable_journal(X):-impact_factor(X)[0.8,0.9],
immediacy_index(X)[0.4,0.6],
cited_half_life(X)[0.6,0.7],
best_position(X)[0.4,0.6].
Now, let us suppose the IEEE Transactions of Fuzzy System journal has the fol-
lowing properties: “high” impact factor, “small” immediacy index, “relatively small”
cited half life and the “best position”. Regarding the linguistic variables: “high”,
“medium”, “relatively big” and “not bad”, which can be related to the following
truth-values: [0.8, 0.9], [0.4, 0.6], [0.6, 0.7] and [0.4, 0.6], respectively, considering
the variables “medium” and “not a bad” with a similar meaning. This knowledge
could be model in an interval-valued fuzzy logic language as follows:
% relatively small
cited_half_life(ieee_fs)[0.3,0.5]
% best position
best_position(ieee_fs) [1,1]
Proximity Equations (PEs). A limitation of this approach is that PEs are mostly
defined for a specific domain [6, 23], being the designer who manually fixes the
values of these equations. This fact makes harder to use PLP systems in real appli-
cations.
A possible solution consists in obtaining the proximity equations from WordNet
which requires to employ interval-valued fuzzy sets in order to deal with the high
uncertainty generated by the possibility of using several different semantic similarity
metrics. Let us assume a fragment of a deductive database that stores information
about people and their preferences. The proximity equations can be generated from
WordNet, we only put here some of them (see [4] for more detail).
% m loves mountaineering
loves(mary,mountaineering).
% j likes football
likes(john,football).
5 Related Work
In the literature, other proposals that address our same goal can be found [24, 25].
One of the most relevant ones is Ciao-Prolog [25] and, for that reason, we will c in
detail the differences between it and Bousi-Prolog in order to clarify and reinforce
the novelty of our proposal:
on the other hand, IVFSs are included in a different way, where the compiler and
the warren abstract machine are enhanced by using a IVFSs data structure which
has been created and adapted for this architecture. As a result, intervals work as
a standard data structure in the code of the program instead of a particular set
of variables defined ad hoc by the programmer. This feature allows us to include
IVFSs in both fuzzy unification (see [4]) and fuzzy resolution. In addition, this
framework also allows other possible extensions, such as the incorporation of a
reasoning module using WordNet (see [4]).
• From the point of view of its syntax. Ciao-Prolog and Bousi-Prolog, although
both are Prolog languages, they have a well differentiated syntax. The former only
allows the annotation of facts, rules cannot be annotated because these only allow
the use of an c operator for the computing of the annotated IVFSs. The latter, on
the other hand, allows the user both the annotation the fact and rules by means of
IVFSs. In addition, if we focus on the inference engine, while Ciao-Prolog only
extends the resolution mechanism, Bousi-Prolog uses interval-valued proximity
equations (e.g., “young teenager = [0.6, 0.8]”), which extends both the resolution
and unification process.
• From the point of view of its semantics. Ciao-Prolog and Bousi-Prolog have rel-
evant differences at the semantic levels as well. Firstly, Bousi-Prolog implements
the concept of cut-level, which allows to the user imposes a threshold in the sys-
tem, and according to it you can be as precise as you want in your answer. This is
a substantial change due to the introduction of a threshold operational semantics.
Therefore, our operational mechanism behaves very much as the one of a Prolog
system (obtaining correct answers one by one), while this option is not available
in Ciao semantics. As we mentioned in Sect. 3.5, a λ-cut for IVFS approximation
degrees has been implemented. The concepts of interpretation, least model seman-
tics, model, so on, are presented and defined in a different way, in Bousi-Prolog
the operational semantics is based an extension of SLD Resolution. In [25] the
type of resolution is based on the classical SLD Resolution of Prolog Systems.
Acknowledgements The authors gratefully acknowledges the comments made by reviewers. This
work has been partially supported by FEDER and the State Research Agency (AEI) of the Spanish
Ministry of Economy and Competition under grants TIN2016-76843-C4-2-R (AEI/FEDER, UE)
16 C. Rubio-Manzano and M. Pereira-Fariña
References
1. Miller, G.A.: Wordnet: a lexical database for English. Commun. ACM 38(11), 39–41 (1995)
2. Liu, H., Singh, P.: Commonsense reasoning in and over natural language. In: Negoita, M.G.,
Howlett, R.J., Jain, L.C. (eds). Proceedings of the 8th International Conference on Knowledge-
Based Intelligent Information and Engineering Systems (KES 2004), Wellington, New Zealand,
20–25, September, pp. 293–306. Springer, Berlin (2004)
3. León-Aráuz, P., Gómez-Romero, J., Bobillo, F.: A fuzzy ontology extension of wordnet and
eurowordnet for specialized knowledge. In: Proceedings of the TKE 2012 (2012)
4. Rubio-Manzano, C., Pereira-Fariña, M.: Towards fuzzy lexical reasoning. J. Intell. Fuzzy Syst.
32(3), 2425–2436 (2017)
5. Medina, J., Ojeda-Aciego, M.: Multi-adjoint logic programming. In: Proceedings of the
10th International Conference on Information Processing and Management of Uncertainty
in Knowledge-Based Systems (IPMU 2004), pp. 823–830 (2004)
6. Julián-Iranzo, P., Moreno, G., Penabad, J., Vázquez, C.: A Declarative Semantics for a Fuzzy
Logic Language Managing Similarities and Truth Degrees, pp. 68–82. Springer International
Publishing, Cham (2016)
7. Julián-Iranzo, P., Moreno, G., Penabad, J., Vázquez, C.: A fuzzy logic programming environ-
ment for managing similarity and truth degrees (2015)
8. Muñoz-Hernandez, S., Pablos-Ceruelo, V., Strass, H.: Rfuzzy: syntax, semantics and imple-
mentation details of a simple and expressive fuzzy tool over prolog. Inf. Sci. 181(10), 1951–
1970 (2011) (Special Issue on Information Engineering Applications Based on Lattices)
9. Straccia, U.: Managing Uncertainty and Vagueness in Description Logics, Logic Programs and
Description Logic Programs, pp. 54–103. Springer, Berlin (2008)
10. Le, V.H, Liu, F., Tran, D.K.: Fuzzy linguistic logic programming and its applications. Theory
Pract. Log. Program. 9(03), 309–341 (2009)
11. Pedersen, T., Patwardhan, S., Michelizzi, J.: Wordnet: similarity: measuring the relatedness of
concepts. In: Demonstration Papers at HLT-NAACL 2004. HLT-NAACL–Demonstrations ’04,
Stroudsburg, PA, USA, Association for Computational Linguistics, pp. 38–41 (2004)
12. Turksen, I.: Four methods of approximate reasoning with interval-valued fuzzy sets. Int. J.
Approx. Reason. 3(2), 121–142 (1989)
13. Bustince, H.: Interval-valued fuzzy sets in soft computing. Int. J. Comput. Intell. Syst. 3(2),
215–222 (2010)
14. Medina, J.: Adjoint pairs on interval-valued fuzzy sets. In: Proceedings of the 13th International
Conference on Information Processing and Management of Uncertainty in Knowledge-Based
Systems (IPMU 2010), pp. 430–439. Springer, Berlin (2010)
15. Rubio-Manzano, C., Julián-Iranzo, P.: A fuzzy linguistic prolog and its applications. J. Intell.
Fuzzy Syst. 26(3), 1503–1516 (2014)
16. Julián-Iranzo, P., Rubio-Manzano, C.: A similarity-based WAM for Bousi-Prolog, pp. 245–252.
Springer, Berlin (2009)
17. Pereira-Fariña, M.: Some reflections on the set-based and the conditional-based interpretations
of statements in syllogistic reasoning. Archiv. Philos. Hist. Soft Comput. 1/2014(1), 1–16
(2014)
18. Hajek, P.: Metamathematics of Fuzzy Logic. Springer Science and Business Media, Berlin
(1998)
On the Incorporation of Interval-Valued Fuzzy Sets into the Bousi-Prolog System … 17
Abstract In this paper we show that every fuzzy matrix with entries in a complete
residuated lattice possess the generalized inverses of certain types, and in particular,
it possess the greatest generalized inverses of these types. We also provide an iterative
method for computing these greatest generalized inverses, which terminates in a finite
number of steps, for example, for all fuzzy matrices with entries in a Heyting algebra.
For other types of generalized inverses we determine criteria for the existence, given
in terms of solvability of particular systems of linear matrix equations. When these
criteria are met, we prove that there is the greatest generalized inverse of the given
type and provide a direct method for its computing.
1 Introduction
Generalized inverses have a very long and rich history. They originated as gen-
eralizations of inverses matrices, linear operators, etc., and have acquired very
important applications in statistics, science and engineering, such as solving matrix
equations, solving singular differential and difference equations, investigation of
Cesaro–Neumann iterations, least squares approximation, finite Markov chains, cryp-
tography, and other areas.
General inverses are commonly defined as solutions of algebraic equations called
Moore–Penrose equations. It is well-known that all systems composed of Moore–
Penrose equations are solvable for matrices over the field of complex numbers.
This implies the existence of all types of generalized inverses defined by these sys-
tems, such as the g-inverse, outer inverse, reflexive g-inverse, last-squares g-inverse,
minimum-norm g-inverse, and Moore–Penrose inverse. Although the group inverse
does not necessarily exist, the Drazin inverse always exists. However, the situation
is completely different when the generalized inverses are considered in the con-
text of semigroups, the most general context in which they are studied. None of
these types of generalized inverses does not necessarily exist in a semigroup, or an
involutive semigroup.
The aim of this paper is to show that fuzzy matrices, with entries in an arbitrary
complete residuated lattice, are somewhere between. It is easy to see that fuzzy
matrices always possess certain types of generalized inverses, such as generalized
inverses defined by the Eq. (2), or those defined by some of the Eqs. (3)–(5) given
below. For example, the zero matrix is always such a generalized inverse. However,
we will show that fuzzy matrices also have other inverses of these types, and in
particular, we show that they possess the greatest such inverses. The Eq. (1) behaves
differently from others, and those types of generalized inverses whose definitions
include this equation do not necessarily exist. Here, in Sect. 2, we determine criteria
for the existence of these types of generalized inverse, including the criteria for the
existence of all previously listed important types of generalized inverses. In addition,
we provide methods for computing the greatest inverses of these types. The method is
iterative and does not necessarily terminate in a finite number of steps for every fuzzy
matrix, but it terminates, for example, for all fuzzy matrices with entries in a Heyting
algebra. To avoid this uncertain, and generally more complicated and demanding
procedure, in Sect. 3 we discuss the problem of representing generalized inverses as
solution to certain equations of the form AX B = C, where A, B and C are given
matrices and X is an unknown matrix. We call them linear equations. We characterize
numerous types of generalized inverses by linear equations, and using them, we
determine the criteria of existence and provide direct methods for computing the
greatest inverses of these types that are generally simpler than those presented in
Sect. 2.
2 Preliminaries
Throughout this paper, N will denote the set of all natural numbers, for any n ∈ N
we write [1, n] = {k ∈ N | 1 k n}, and N0 = N ∪ {0}.
A residuated lattice is an algebra L = (L , ∧, ∨, ⊗, →, 0, 1) such that
(L1) (L , ∧, ∨, 0, 1) is a lattice with the least element 0 and the greatest element 1,
(L2) (L , ⊗, 1) is a commutative monoid with the unit 1,
(L3) ⊗ and → satisfy the residuation property: for all x, y, z ∈ L,
x ⊗ y z ⇔ x y → z.
There had been for two years under 1697. Jan. 16.
process in the Court of Session a case in
which a husband was sued for return of a deceased wife’s tocher of
eight thousand merks (£444, 8s. 10d.⅔), and her paraphernalia or
things pertaining to her person. It came, on this occasion, to be
debated what articles belonging to a married woman were to be
considered as paraphernalia, or jocalia, and so destined in a
particular way in case of her decease. The Lords, after long
deliberation, fixed on a rule to be observed in future cases, having a
regard, on the one hand, to ‘the dignity of wives,’ and, on the other,
to the restraining of extravagances. First was ‘the mundus or vestitus
muliebris—namely, all the body-clothes belonging to the wife,
acquired by her at any time, whether in this or any prior marriage, or
in virginity or viduity; and whatever other ornaments or other things
were peculiar or proper to her person, and not proper to men’s use or
wearing, as necklaces, earrings, breast-jewels, gold chains, bracelets,
&c. Under childbed linens, as paraphernal and proper to the wife,
are to be understood only the linen on the wife’s person in childbed,
but not the linens on the child itself, nor on the bed or room, which
are to be reckoned as common movables; therefore found the child’s
spoon, porringer, and whistle contained in the condescendence [in
this special case] are not paraphernal, but fall under the communion
of goods; but that ribbons, cut or uncut, are paraphernal, and belong
to the wife, unless the husband were a merchant. All the other
articles that are of their own nature of promiscuous and common
use, either to men or women, are not paraphernal, but fall under the
communion of goods, unless they become peculiar and paraphernal
by the gift and appropriation of the husband to her, such as a
marriage-watch, rings, jewels, and medals. A purse of gold or other
movables that, by the gift of a former husband, became properly the
wife’s goods and paraphernal, exclusive of the husband, are only to
be reckoned as common movables quoad a second husband, unless
they be of new gifted and appropriated by him to the wife again. Such
gifts and presents as one gives to his bride before or on the day of the
marriage, are paraphernal and irrevokable by the husband during
that marriage, and belong only to the wife 1697.
and her executors; but any gifts by the
husband to the wife after the marriage-day are revokable, either by
the husband making use of them himself, or taking them back during
the marriage; but if the wife be in possession of them during the
marriage or at her death, the same are not revokable by the husband
thereafter. Cabinets, coffers, &c., for holding the paraphernalia, are
not paraphernalia, but fall under the communion of goods. Some of
the Lords were for making anything given the next morning after the
marriage, paraphernalia, called the morning gift in our law; but the
Lords esteemed them man and wife then, and [the gift] so
irrevokable.’[197]