Nelson algebras arise naturally in algebraic logic as the algebraic models of Nelson’s constructive logic with strong negation. This note gives two characterisations of the variety of Nelson algebras up to term equivalence, together with a characterisation of the finite Nelson algebras up to polynomial equivalence. The results answer a question of Blok and Pigozzi and clarify some earlier work ...

the idea of this paper is designing an automatic fault detection system based on fuzzy logic, therefore two signals of pmsm in fault condition are analyzed for inter turn fault detection: current and torque. in this fault type there is some distortion in these signals, but it is not good enough to detecting with fuzzy logic solely, so with combination of wavelet transform and fcm a new method f...

In this paper, two problems on domino logic synthesis are addressed. A mapping method that maps the complementary logic cones independently when AND/OR logic is to be implemented, and together using dual-monotonic gates in the case of XOR/XNOR logic, is proposed. The results show up to 28.9% improvement in area and always show the same or better performance in delay over existing approaches. Th...

In this abstract, we develop a solid theoretical foundation for a bottom-up program specialisation technique, capable of specialising a logic program w.r.t. a set of unit clauses. Extending a well-known operator, originally introduced for composing logic programs, we deene a bottom-up partial deduction operator and prove correctness of the transformation with respect to the S-semantics.

Termination of logic programs with negated body atoms (here called general logic programs) is an important topic. One reason is that many computational mechanisms used to process negated atoms, like Clark's negation as failure and Chan's constructive negation, are based on termination conditions. This paper introduces a methodology for proving termination of general logic programs w.r.t. the Pr...

Logic and I O Block The logic block used in an FPGA strongly in uences the FPGA speed and area e ciency While many di erent logic blocks have been used in FPGAs most current commercial FPGAs are using logic blocks based on look up tables LUTs Accordingly in our research we will only build abstract logic block for those LUT based FPGAs One abstract basic logic block is shown in Fig It contains a...

Domino logic is a CMOS-based evolution of the dynamic logic techniques. It allows a rail-to-rail logic swing. It was developed to speed up circuits. In integrated circuit design, dynamic logic (or sometimes clocked logic) is a design methodology in combinatorial logic circuits, particularly those implemented in MOS technology. This work is oriented towards implementing the domino logic circuits...

We introduce a new dual threshold voltage technique for domino logic. Since domino logic is much more sensitive to noise, noise margins have to be taken into account when applying dual threshold voltages to domino logic. To guarantee the signal integrity in domino logic, we carefully consider the effect of transistor sizing and threshold voltage selection. For optimal design, tradeoffs need to ...