A b s t r a c t. The paper deals with functional properties of three-valued logics. We consider the family of regular three-valued Kleene's logics (strong, weak, intermediate) and it's extensions by adding an implicative connectives (" natural " implications). The main result of our paper is the lattice that describes the relations between implicative extensions of regular logics. In this paper...

In this paper we review the development & advantages of multi valued logic. The multi valued logic has been object of research over last few decades. Since 1971 there have been annual symposiums on multi valued logic. The use of non binary logic or discrete-analog signal processing is not out of the question if the multiple-valued hardware algorithms are developed for fast parallel operations. ...

This paper deals with logic programs containing two kinds of negation: negation as failure and explicit negation. This allows two diierent forms of reasoning in the presence of incomplete information. Such programs have been introduced by Gelfond and Lifschitz and called extended programs. We provide them with a logical semantics in the style of Kunen, based on Belnap's four-valued logic, and a...

In [1] the authors considered finitely-valued modal logics with Kripke style semantics where both propositions and the accessibility relation are valued over a finite residuated lattice. Unfortunately, the necessity operator does not satisfy in general the normality axiom (K). In this paper we focus on the case of finite chains, and we consider a different approach based on introducing a multim...

This paper shows some interesting properties of Kleene’s threevalued logic in relation to abductive reasoning. A semantical characterization of abductive explanations is proposed, based on the notion of minimal three-valued model. This establishes a relation between the minimization problem in abductive reasoning and three-valued semantics, in the same sense as non-monotonic reasoning deals wit...

In this paper, we investigate the family LS0.5 of many-valued modal logics LS0.5's. We prove that modalities necessity and possibility LS0.5's capture well-defined bivalent concepts logical validity consistency. also show these can be used as recovery operators.

Software model-checking based on the CEGAR framework can be made more precise by separating non-determinism from the lack of information due to abstraction. The two can be modeled individually using four-valued Belnap logic. In addition, this logic allows reasoning about negations effectively and thus enables checking of full CTL. In this paper, we present YASM – a new symbolic software model-c...

A method to perform diagnostic test generation in sequential circuits by modifying a conventional test generator is presented. The method utilizes circuit netlist modification along with a forced value at a primary input in the modified circuit. Techniques to reduce the computational effort for diagnostic test pattern generation in sequential circuits are also presented. Speed-up of the diagnos...