Contradiction versus Selfcontradiction in Fuzzy Logic

* This work is partially supported by CICYT (Spain) under project TIN 2005-08943-C02-001 and by UPM-CAM (Spain) under project R05/11240.

A Geometrical Interpretation to Define Contradiction Degrees between Two Fuzzy Sets

For inference purposes in both classical and fuzzy logic, neither the information itself should be contradictory, nor should any of the items of available information contradict each other. In order to avoid these troubles in fuzzy logic, a study about contradiction was initiated by Trillas et al. in [5] and [6]. They introduced the concepts of both self-contradictory fuzzy set and contradiction between two fuzzy sets. Moreover, the need to study not only contradiction but also the degree of such contradiction is pointed out in [1] and [2], suggesting some measures for this purpose. Nevertheless, contradiction could have been measured in some other way. This paper focuses on the study of contradiction between two fuzzy sets dealing with the problem from a geometrical point of view that allow us to find out new ways to measure the contradiction degree. To do this, the two fuzzy sets are interpreted as a subset of the unit square, and the so called contradiction region is determined. Specially we tackle the case in which both sets represent a curve in [0,1]2. This new geometrical approach allows us to obtain different functions to measure contradiction throughout distances. Moreover, some properties of these contradiction measure functions are established and, in some particular case, the relations among these different functions are obtained.

Applications of the Sufficiency Principle in Acceleration of Neural Networks Trainig

One of the problems in AI tasks solving by neurocomputing methods is a considerable training time. This problem especially appears when it is needed to reach high quality in forecast reliability or pattern recognition. Some formalised ways for increasing of networks’ training speed without loosing of precision are proposed here. The offered approaches are based on the Sufficiency Principle, which is formal representation of the aim of a concrete task and conditions (limitations) of their solving [1]. This is development of the concept that includes the formal aims’ description to the context of such AI tasks as classification, pattern recognition, estimation etc.

A Fractional Analog of the Duhamel Principle

Mathematics Subject Classification: 35CXX, 26A33, 35S10

Application of Subordination Principle to Log-Harmonic alpha-spirallike Mappings

MSC 2010: 30C45, 30C55

Applications of Subordination Principle to Log-Harmonic Mappings

MSC 2010: 30C45, 30C55

Hamilton’s Principle with Variable Order Fractional Derivatives

MSC 2010: 26A33, 70H25, 46F12, 34K37 Dedicated to 80-th birthday of Prof. Rudolf Gorenflo

Maximum Principle and Its Application for the Time-Fractional Diffusion Equations

MSC 2010: 26A33, 33E12, 35B45, 35B50, 35K99, 45K05 Dedicated to Professor Rudolf Gorenflo on the occasion of his 80th anniversary

On Principle Eigenvalue for Linear Second Order Elliptic Equations in Divergence Form

2002 Mathematics Subject Classification: 35J15, 35J25, 35B05, 35B50

Minimum Description Length Principle in Discriminating Marginal Distributions

2010 Mathematics Subject Classification: 94A17, 62B10, 62F03.