Sciweavers

461 search results - page 20 / 93
» An Algorithm for Bi-Decomposition of Logic Functions
Sort
View
DAC
2008
ACM
16 years 6 months ago
Bi-decomposing large Boolean functions via interpolation and satisfiability solving
Boolean function bi-decomposition is a fundamental operation in logic synthesis. A function f(X) is bi-decomposable under a variable partition XA, XB, XC on X if it can be written...
Ruei-Rung Lee, Jie-Hong Roland Jiang, Wei-Lun Hung
VLSID
2009
IEEE
130views VLSI» more  VLSID 2009»
16 years 6 months ago
Reversible Logic Synthesis with Output Permutation
Synthesis of reversible logic has become a very important research area. In recent years several algorithms ? heuristic as well as exact ones ? have been introduced in this area. ...
Daniel Große, Gerhard W. Dueck, Robert Wille...
POPL
2012
ACM
14 years 1 months ago
Recursive proofs for inductive tree data-structures
We develop logical mechanisms and decision procedures to facilitate the verification of full functional properties of inductive tree data-structures using recursion that are soun...
Parthasarathy Madhusudan, Xiaokang Qiu, Andrei Ste...
ICNC
2005
Springer
15 years 11 months ago
Credit Rating Analysis with AFS Fuzzy Logic
In this paper, we propose a new machine learning approach based on AFS (Axiomatic Fuzzy Sets) fuzzy logic, in attempt to provide a better model with interpretability. First, we wil...
Xiaodong Liu, Wanquan Liu
DATE
1998
IEEE
92views Hardware» more  DATE 1998»
15 years 9 months ago
Restructuring Logic Representations with Easily Detectable Simple Disjunctive Decompositions
Simple disjunctive decomposition is a special case of logic function decompositions, where variables are divided into two disjoint sets and there is only one newly introduced vari...
Hiroshi Sawada, Shigeru Yamashita, Akira Nagoya