The main condition of the differently implicational inferencealgorithm is reconsidered from a contrary direction, which motivatesa new fuzzy inference strategy, called the double fuzzyimplications-based restriction inference algorithm. New restrictioninference principle is proposed, which improves the principle of thefull implication restriction inference algorithm. Furthermore,focusing on the ...

This paper focuses on the robustness problem of full implication triple implication inference method for fuzzy reasoning. First of all, based on strong regular implication, the weighted logic metric for measuring distance between two fuzzy sets is proposed. Besides, under this metric, some robustness results of the triple implication method are obtained, which demonstrates that the triple impli...

Two important basic inference models of fuzzy reasoning are Fuzzy Modus Ponens (FMP) and Tollens (FMT). In order to solve FMP FMT problems, the full implication triple I algorithm, reverse algorithm Subsethood Inference (SIS for short) proposed, respectively. Furthermore, existing algorithms extended intuitionistic sets interval-valued according different needs. The purpose this paper is study ...

Three-way fuzzy inference is the theoretical basis of three-way control. The proposed TCRI method based on a Mamdani implication operator and uses one simple composition operation. In order to effectively improve method, this paper proposes full triple I algorithm for gives solution TFMP problem. emphasis our research R0 Go¨del solution, which related residual implication, as well Zadeh’s Mamda...

Logical inference algorithms for conditional independence (CI) statements have important applications from testing consistency during knowledge elicitation to constraintbased structure learning of graphical models. We prove that the implication problem for CI statements is decidable, given that the size of the domains of the random variables is known and fixed. We will present an approximate lo...

We review key constraints in the context of XML as introduced by Buneman et al. We show that one of the proposed inference rules is not sound in general, and the axiomatisation proposed for XML keys is incomplete even if key paths are simple. Therefore, the axiomatisation and also the implication problem for XML keys are still unsolved. We propose a set of inference rules that is indeed sound a...

We introduce an implication-with-possible-exceptions and define validity of rules-withpossible-exceptions by means of the topological notion of a full subset. Our implication-with-possibleexceptions characterises the preferential consequence relation as axiomatized by Kraus, Lehmann and Magidor [Kraus, Lehmann, and Magidor, 1990]. The resulting inference relation is non-monotonic. On the other ...