This paper presents a bidirectional inference algorithm for sequence labeling problems such as part-of-speech tagging, named entity recognition and text chunking. The algorithm can enumerate all possible decomposition structures and find the highest probability sequence together with the corresponding decomposition structure in polynomial time. We also present an efficient decoding algorithm ba...

This paper presents a self-learning algorithm using a dynamic testability measure to accelerate test generation. It also introduces the concepts o f full logic value label backward implication, the dependent backtrack and K-limited backtracks. Results indicating a high fault coverage are also presented for ten benchmark combinational circuits.

This paper describes FPGA realization of a Fuzzy Temperature Controller (FTC) using VHDL intended for industrial application. The system is built up with four major modules namely fuzzification, inference, implication and defuzzification. The composition method selected for the fuzzy model is the MaxMin composition while the Mamdani Min operator is chosen as the implication method. Each module ...

Advanced type system features, such as GADTs, type classes, and type families, have proven to be invaluable language extensions for ensuring data invariants and program correctness. Unfortunately, they pose a tough problem for type inference when they are used as local type assumptions. Local type assumptions often result in the lack of principal types and cast the generalisation of local let-b...

While using automated learning methods, the lack of accuracy and poor knowledge generalization are both typical problems for a rule-based system obtained on a given data set. This paper introduces a new method capable of generating an accurate rule-based fuzzy inference system with parameterized consequences using an automated, off-line learning process based on multi-phase evolutionary computi...

This paper presents a study on inference in a Fuzzy Logic Controller (FLC). Inference is made up of interpretation, implication, combination and defuzzification. These last two steps can be performed in two sequences. An explanation, through approximate reasoning, on how to implement other than the welìknown Mamdani and Larsen implications is given. (Dis)advantages of several combinations of im...

Presupposition projection in quantified sentences is at the center of debates in the presupposition literature. This paper reports on a survey revealing inter-speaker variation regarding which quantifier yields universal inferences—which Q in QpBqpλx.Cpxqppxqq supports the inference @x P B: ppxq. We observe an implication that if some yields a universal inference for a speaker, no, and any in a...

Languages based on variations of the lambda calculus are designed to permit the slick, uniication-based technique for type inference, which is by now a well-established discipline. Other widely used languages have been created less by design and more by coincidence and compromise. It seems therefore that the question of type inference for such languages could be infeasible or should at least pe...

This paper presents a study on inference in a Fuzzy Logic Controller (FLC). Inference is made up of interpretation, implication, combination and defuzzification. These last two steps can be performed in two sequences. An explanation, through approximate reasoning, on how to implement other than the welìknown Mamdani and Larsen implications is given. (Dis)advantages of several combinations of im...

The desirability of Horn clauses in logical deductive systems has long been recognized. The reasons are at least threefold. Firstly, while inference algorithms for full logics of any reasonable extent are typically intractable, for systems restricted to Horn clauses the picture is much better. (For example, in ordinary propositional logic, while the full satissability problem is NP-complete, a ...