Sciweavers

156 search results - page 19 / 32
» Propositional Logic for Circuit Classes
Sort
View
ICLP
2003
Springer
14 years 28 days ago
Uniform Equivalence of Logic Programs under the Stable Model Semantics
In recent research on nonmonotonic logic programming, repeatedly strong equivalence of logic programs P and Q has been considered, which holds if the programs P ∪ R and Q ∪ R h...
Thomas Eiter, Michael Fink
ATS
2004
IEEE
116views Hardware» more  ATS 2004»
13 years 11 months ago
Testing for Missing-Gate Faults in Reversible Circuits
Logical reversibility occurs in low-power applications and is an essential feature of quantum circuits. Of special interest are reversible circuits constructed from a class of rev...
John P. Hayes, Ilia Polian, Bernd Becker
ASPDAC
2010
ACM
161views Hardware» more  ASPDAC 2010»
13 years 5 months ago
Novel dual-Vth independent-gate FinFET circuits
This paper describes gate work function and oxide thickness tuning to realize novel circuits using dual-Vth independent-gate FinFETs. Dual-Vth FinFETs with independent gates enabl...
Masoud Rostami, Kartik Mohanram
ICLP
2001
Springer
14 years 5 days ago
Alternating Fixed Points in Boolean Equation Systems as Preferred Stable Models
We formally characterize alternating fixed points of boolean equation systems as models of (propositional) normal logic programs. To this end, we introduce the notion of a preferr...
K. Narayan Kumar, C. R. Ramakrishnan, Scott A. Smo...
CORR
2011
Springer
165views Education» more  CORR 2011»
13 years 2 months ago
From IF to BI: a tale of dependence and separation
We take a fresh look at the logics of informational dependence and independence of Hintikka and Sandu and V¨a¨an¨anen, and their compositional semantics due to Hodges. We show h...
Samson Abramsky, Jouko A. Väänänen