Sciweavers

71 search results - page 4 / 15
» The disjunctive decomposition of logic functions
Sort
View
ICCAD
2008
IEEE
140views Hardware» more  ICCAD 2008»
15 years 6 months ago
To SAT or not to SAT: Ashenhurst decomposition in a large scale
Functional decomposition is a fundamental operation in logic synthesis. Prior BDD-based approaches to functional decomposition suffer from the memory explosion problem and do not...
Hsuan-Po Lin, Jie-Hong Roland Jiang, Ruei-Rung Lee
DEXAW
2003
IEEE
113views Database» more  DEXAW 2003»
15 years 2 months ago
Integrating Ontology Languages and Answer Set Programming
We integrate ontology languages and logic programming (LP) by extending disjunctive logic programs (DLPs) and their semantics in order to support inverses and an infinite univers...
Stijn Heymans, Dirk Vermeir
FLAIRS
2007
14 years 12 months ago
Handling Qualitative Preferences Using Normal Form Functions
Reasoning about preferences is a major issue in many decision making problems. Recently, a new logic for handling preferences, called Qualitative Choice Logic (QCL), was presented...
Salem Benferhat, Daniel Le Berre, Karima Sedki
ICCD
1996
IEEE
170views Hardware» more  ICCD 1996»
15 years 1 months ago
Boolean Function Representation Based on Disjoint-Support Decompositions
The Multi-Level Decomposition Diagrams (MLDDs) of this paper are a canonical representation of Boolean functions expliciting disjoint-support decompositions. MLDDs allow the reduc...
Valeria Bertacco, Maurizio Damiani
ASPDAC
2008
ACM
92views Hardware» more  ASPDAC 2008»
14 years 11 months ago
Decomposition based approach for synthesis of multi-level threshold logic circuits
Scaling is currently the most popular technique used to improve performance metrics of CMOS circuits. This cannot go on forever because the properties that are responsible for the ...
Tejaswi Gowda, Sarma B. K. Vrudhula