Irredundant Disjunctive and Conjunctive Forms of a Boolean Function
نویسنده
چکیده
A thorough algebraic method is described for the determination of the complete set of irre-dundant normal and conjunctive forms of a Boolean function. The method is mechanical and therefore highly programmable on a computer.
منابع مشابه
Solving Disjunctive/Conjunctive Boolean Equation Systems with Alternating Fixed Points
This paper presents a technique for the resolution of alternating disjunctive/conjunctive boolean equation systems. The technique can be used to solve various verification problems on finitestate concurrent systems, by encoding the problems as boolean equation systems and determining their local solutions. The main contribution of this paper is that a recent resolution technique from [13] for d...
متن کاملSome comments on fuzzy normal forms
In this paper, we examine and compare de Morgan-, Kleene-, and Boolean-disjunctive and conjunctive normal forms in fuzzy settings. This generalizes papers of Turksen on the subject of Boolean-normal forms.
متن کاملInequalities in De Morgan Systems II
In [2], I. B. Turksen looked at the Booleandisjunctive normal form of a term in two variables and the Boolean-conjunctive normal form of that term. He concluded that for some cases of certain families, when these forms are interpreted in a De Morgan system by replacing the meet by a t-norm and the join by the dual t-conorm, the disjunctive normal form is contained in the conjunctive normal f...
متن کاملEvaluating and Comparing Fault-Based Testing Strategies for General Boolean Specifications: A Series of Experiments
A great amount of fault-based testing strategies have been proposed to generate test cases for detecting certain types of faults in Boolean specifications. However, most of the previous studies on these strategies were focused on the Boolean expressions in the disjunctive normal form, even the irredundant disjunctive normal form — little work has been conducted to comprehensively investigate th...
متن کاملOn the orthogonalization of arbitrary Boolean formulae
The orthogonal conjunctive normal form of a Boolean function is a conjunctive normal form in which any two clauses contain at least a pair of complementary literals. Orthogonal disjunctive normal form is defined similarly. Orthogonalization is the process of transforming the normal form of a Boolean function to orthogonal normal form. The problem is of great relevance in several applications, f...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- IBM Journal of Research and Development
دوره 1 شماره
صفحات -
تاریخ انتشار 1957