The logic decomposition of incompletely specified functions (ISFs) is studied. A theoretical support based on ternary algebras is provided. This support aims at the logic decomposition of ISFs. A partial order is defined on the ISFs determined by the definedness' of the functions, in which the completely specified functions are the maximal elements. The proposed methods aim at preserving the ISFs as undefined as possible during logic decomposition. Incompletely specified diagrams (IDDs) are proposed as a graph-based formalism to efficiently explore different decompositions
Simple disjunctive decomposition is a special case of logic function decompositions, where variables...
AbstractPartial functions are the most suitable characterization of program effects. Formal reasonin...
Abstract. The contribution deals with decomposition of logical systems for the purpose of solving an...
The logic decomposition of incompletely specified functions (ISFs) is studied. A theoretical support...
The problem of recognizing decomposability of incompletely defined Boolean relations is considered. ...
Functional decomposition aims at finding efficient representations for Boolean functions. It is used...
The problem of decomposition of a Boolean function is to represent a given Boolean function in the f...
Several approaches to logical specification of functions are compared. Main attention is paid to LPT...
The problem of parallel decomposition f (x) = j ( m (u), l (v) ) of an incompletely specified Boole...
AbstractThe problem of recognizing decomposability of partially defined Boolean functions is conside...
We provide a sound and complete proof system for an extension of Kleene’s ternary logic to predicate...
This paper shows that the problem of decomposing a finite function f(A, B) into the form h (g(A), B)...
summary:This paper is concerned with the minimization of logical functions in normal disjunctive for...
A method for bi-decomposition of incompletely specified (partial) Boolean functions is suggested. Th...
The need to use partial functions arises frequently in formal descriptions of computer systems. Howe...
Simple disjunctive decomposition is a special case of logic function decompositions, where variables...
AbstractPartial functions are the most suitable characterization of program effects. Formal reasonin...
Abstract. The contribution deals with decomposition of logical systems for the purpose of solving an...
The logic decomposition of incompletely specified functions (ISFs) is studied. A theoretical support...
The problem of recognizing decomposability of incompletely defined Boolean relations is considered. ...
Functional decomposition aims at finding efficient representations for Boolean functions. It is used...
The problem of decomposition of a Boolean function is to represent a given Boolean function in the f...
Several approaches to logical specification of functions are compared. Main attention is paid to LPT...
The problem of parallel decomposition f (x) = j ( m (u), l (v) ) of an incompletely specified Boole...
AbstractThe problem of recognizing decomposability of partially defined Boolean functions is conside...
We provide a sound and complete proof system for an extension of Kleene’s ternary logic to predicate...
This paper shows that the problem of decomposing a finite function f(A, B) into the form h (g(A), B)...
summary:This paper is concerned with the minimization of logical functions in normal disjunctive for...
A method for bi-decomposition of incompletely specified (partial) Boolean functions is suggested. Th...
The need to use partial functions arises frequently in formal descriptions of computer systems. Howe...
Simple disjunctive decomposition is a special case of logic function decompositions, where variables...
AbstractPartial functions are the most suitable characterization of program effects. Formal reasonin...
Abstract. The contribution deals with decomposition of logical systems for the purpose of solving an...