In order to get a more general result related on fuzzy implications that induced by aggregation functions, we relax the definition of overlap precisely, removing its right-continuous, and introduce new kind function, which called semi-overlap function. Subsequently, explore some their algebraic properties corresponding residual implications. Moreover, serval scholars have provided kinds methods...

The importance of inference rules to semantic applications has long been recognized, and extensive work has been carried out to automatically acquire inference-rule resources. However, despite their potential, the utilization of inference rule resources is currently somewhat limited, in part due to the considerable number of rules which are in fact invalid. A possible solution to this problem i...

Semantic compositionality (where the meaning of a phrase depends only on the meaning of its sub-phrases) is a desirable property for a language to possess, because it admits proofs by structural induction over the terms of the language. Regular expressions and propositional logic are compositional languages in this sense. However, although some programming languages are said to have a compositi...

A procedure is given for recognizing sets of inference rules that generate polynomial time decidable inference relations. The procedure can automatically recognize the tractability of the inference rules underlying congruence closure. The recognition of tractability for that particular rule set constitutes mechanical veriication of a theorem originally proved independently by Kozen and Shostak....

This paper describes a tool called Explain for performing abductive inference. Logical abduction is the problem of finding a simple explanatory hypothesis that explains observed facts. Specifically, given a set of premises Γ and a desired conclusion φ, abductive inference finds a simple explanation ψ such that Γ ∧ ψ |= φ, and ψ is consistent with known premises Γ . Abduction has many useful app...

In this paper we formulate a novel AND/OR graph representation for parsing articulated objects into parts and recovering their poses. The AND/OR graph allows us to handle an enormous variety of articulated poses with a compact graphical model. We develop a novel inference algorithm, compositional inference, that uses a bottom-up compositional process for proposing configurations for the object....

High-throughput sequencing based techniques, such as 16S rRNA gene profiling, have the potential to elucidate the complex inner workings of natural microbial communities - be they from the world's oceans or the human gut. A key step in exploring such data is the identification of dependencies between members of these communities, which is commonly achieved by correlation analysis. However, it h...

In this paper, we present an evolutionary multiobjective learning model achieving positive synergy between the Inference System and the Rule Base in order to obtain simpler, more compact and still accurate linguistic fuzzy models by learning fuzzy inference operators together with Rule Base. The Multiobjective Evolutionary Algorithm proposed generates a set of Fuzzy Rule Based Systems with diff...

We present a framework for formally proving that the composition of the behaviors of the different parts of a complex, real-time system ensures a desired global specification of the overall system. The framework is based on a simple compositional rely/guarantee circular inference rule, plus a small set of conditions concerning the integration of the different parts into a whole system. The refe...

Liu’s inference is a process of deriving consequences from uncertain knowledge or evidence via the tool of conditional uncertainty. Using identification functions, this paper derives some expressions of Liu’s inference rule for uncertain systems. This paper also discusses Liu’s inference rule with multiple antecedents and with multiple if-then rules.