نتایج جستجو برای: full implication inference algorithm
تعداد نتایج: 1133328 فیلتر نتایج به سال:
Keys for XML data trees can uniquely identify nodes based on the data values on some of their subnodes, either in the entire tree or relatively to some selected subtrees. Such keys have an impact on several XML applications. A challenge is to identify expressive classes of keys with good computational properties. In this paper, we propose such a new class of keys. In comparison to previous work...
This paper shows that type-checking and type-inference problems are equivalent in domain-free lambda calculi with existential types, that is, type-checking problem is Turing reducible to typeinference problem and vice versa. In this paper, the equivalence is proved for two variants of domain-free lambda calculi with existential types: one is an implication and existence fragment, and the other ...
A comparison is made of two approaches to approximate reasoning: Mamdani's interpolation method and the implication method. Both approaches are variants of Zadeh's compositional rule of inference. It is shown that the approaches are not equivalent. A correspondence between the approaches is established via the inverse of the implied fuzzy relation. The interpolation method has the lowest time-c...
We present full of the properties about HM(X). HM(X) is a general framework for Hindley/Milner type systems with constraints. Speciic type systems can be obtained by instantiating the constraint parameter X. For instance, the Hindley/Milner type system itself can be obtained by instantiating X to the Herbrand constraint system. We give a generic type infernce algorithm for HM(X) type systems. U...
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.
Optimization-based state estimation is useful for handling of constrained linear or nonlinear dynamical systems. It has an ideal form, known as full information (FIE) which uses all past measurements to perform estimation, and also a practical counterpart, moving-horizon (MHE) most recent limited length the estimation. This work reveals generic link from robust stability FIE that MHE, showing f...
Intuitive multistage inferences are typically excessive when compared with the optimal model, a modified form of Bayes' theorem. One explanation for this excessiveness is that the S primarily attends to the implications of the probable event described by the first-stage inference, neglecting the implications of less likely events. If a S follows this strategy, called a "best guess" strategy, th...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید