In this contribution we plan to characterise fuzzy implication operators based on three basic properties and the defuzzification methods suitable to be used in combination with them. We want to characterise the proper use of implication operators in Fuzzy Rule Based Systems for control problems.

and Local Rule Learning in Attributed Networks Henry Soldano(B), Guillaume Santini, and Dominique Bouthinon 1 Université Paris 13, Sorbonne Paris Cité, L.I.P.N UMR-CNRS 7030 F-93430, Villetaneuse, France 2 Atelier de BioInformatique, ISYEB UMR 7205 CNRS MNHN UPMC EPHE, Museum d’Histoire Naturelle, F-75005, Paris, France Abstract. We address the problem of finding local patterns and related loca...

We resolve an open problem concerning finite logical implication for path functional dependencies (PFDs). This note is an addendum to [4]. In this note we show that the finite logical implication for description logics endowed with PFDs is undecidable. This result complements the decidability of the unrestricted problem that is complete for EXPTIME [2,3].

In this paper, the perturbation of fuzzy connectives and the robustness of fuzzy reasoning are investigated. This perturbation of Schweizer-Sklar parameterized t-norms and its residuated implication operators are given. We show that full implication triple I algorithms based on Schweizer-sklar operators are robust for normalized Minkowski distance.

The Mamdani model [1] of Fuzzy Systems is the earliest and the most widely studied type of Fuzzy Systems. In this work, Residuated Implication (R-implication) operators have been explored for rule reduction in Mamdani-Type Fuzzy Systems with lossless inferencing.

We present a complete finite axiomatization of the unrestricted implication problem for inclusion and conditional independence atoms in the context of dependence logic. For databases, our result implies a finite axiomatization of the unrestricted implication problem for inclusion, functional, and embedded multivalued dependencies in the unirelational case.

In this paper, we point out that the definition of fuzzy attribute implication actually implies a minimal degree and thus may be impractical in some applications. To solve this, we introduce probability information to fuzzy inclusion degree, and discuss some properties of this definition. Illustrations verifies the correctness of probability fuzzy attribute implication.

Introduction. In this work we discuss recursive mappings between theories which preserve deducibility, negation and implication. Roughly, we prove that any two axiomatizable theories containing a small fragment of arithmetic—this can be stated precisely—are "isomorphic" by a primitive recursive function mapping sentences onto sentences which also preserves deducibility, negation and implication...

Contrapositive symmetry (CPS) is a tautology in classical logic. In fuzzy logic, not all fuzzy implications have CPS with respect to a given strong negation. Given a fuzzy implication J , towards imparting contrapositive symmetry to J with respect to a strong negation N two techniques, viz., upper and lower contrapositivisation, have been proposed by Bandler and Kohout [Semantics of implication...