some applications are critical and must designed Fault Tolerant System. Usually Voting Algorithm is one of the principle elements of a Fault Tolerant System. Two kinds of voting algorithm are used in most applications, they are majority voting algorithm and weighted average algorithm these algorithms have some problems. Majority confronts with the problem of threshold limits and voter of weight...

some applications are critical and must designed Fault Tolerant System. Usually Voting Algorithm is one of the principle elements of a Fault Tolerant System. Two kinds of voting algorithm are used in most applications, they are majority voting algorithm and weighted average algorithm these algorithms have some problems. Majority confronts with the problem of threshold limits and voter of weight...

This paper presents a recent formalization of Henkin-style completeness proof for the propositional modal logic S5 using Lean theorem prover. The formalized is close to that Hughes and Cresswell [], but system, based on different choice axioms, better described as Mendelson system augmented with axiom schemes K, T, S4, B, necessitation rule inference. language has false implication only primiti...

Many DPLL-based [1] SAT solvers use an implementation of the two-literal watching scheme (TLWS) first used in Chaff [6] for boolean constraint propagation (BCP). For the extreme case of binary clauses this otherwise efficient algorithm has a large overhead in memory usage. In this report a technique called implication table for augmenting TLWS will be described and mathematically analyzed, that...

an efficient cluster head selection algorithm in wireless sensor networks is proposed in this paper. the implementation of the proposed algorithm can improve energy which allows the structured representation of a network topology. according to the residual energy, number of the neighbors, and the centrality of each node, the algorithm uses fuzzy inference systems to select cluster head. the alg...

The implication of multivalued dependencies (MVDs) in relational databases has originally been defined in the context of some fixed finite universe. While axiomatisability and implication problem have been intensely studied with respect to this notion, almost no research has been devoted towards the alternative notion of implication in which the underlying universe of attributes is left undeter...

The Problem: It has become clear that a robust full-text natural language question-answering system cannot realistically be expected any time soon. Numerous problems such as intersentential reference and paraphrasing, summarization, common sense implication, and many more, will take a long time to solve to everybody’s satisfaction. At the same time, however, it turns out that given a sophistica...

Constraint-based type inference infers types with subtyping constraints. Such types can capture detailed data and control flow information about the analyzed program. In the presence of polymorphism, existing constraint-based type inference algorithms sacrifice much precision for efficiency. This paper presents both theoretical and practical results on developing precise and efficient polymorph...

We study inference systems of weak functional dependencies in relational and complex-value databases. Functional dependencies form a very common class of database constraints. Designers and administrators proficiently utilise them in everyday database practice. Functional dependencies correspond to the linear-time decidable fragment of Horn clauses in propositional logic. Weak functional depend...

This paper describes the VHDL modeling of temperature controller based on fuzzy logic intended for industrial application. The system is built of four major modules called fuzzification, inference, implication and defuzzification. The composition method selected for the fuzzy model is the Max-Min composition while the Mamdani Min operator was chosen as the implication method. Each module is mod...