Sciweavers

454 search results - page 56 / 91
» Representation results for defeasible logic
Sort
View
DAC
2001
ACM
14 years 9 months ago
Circuit-based Boolean Reasoning
Many tasks in CAD, such as equivalence checking, property checking, logic synthesis, and false paths analysis require efficient Boolean reasoning for problems derived from circuit...
Andreas Kuehlmann, Malay K. Ganai, Viresh Paruthi
CADE
2003
Springer
14 years 9 months ago
Algorithms for Ordinal Arithmetic
Ordinals form the basis for termination proofs in ACL2. Currently, ACL2 uses a rather inefficient representation for the ordinals up to 0 and provides limited support for reasoning...
Panagiotis Manolios, Daron Vroon
SBCCI
2004
ACM
134views VLSI» more  SBCCI 2004»
14 years 2 months ago
An approach to computer simulation of bonding and package crosstalk in mixed-signal CMOS ICs
This paper presents an approach for simulation of mixed analog-digital CMOS integrated circuits, aiming at estimating crosstalk effects due to current pulses drawn from voltage s...
Gabriella Trucco, Giorgio Boselli, Valentino Liber...
GLVLSI
2002
IEEE
160views VLSI» more  GLVLSI 2002»
14 years 1 months ago
Computing walsh, arithmetic, and reed-muller spectral decision diagrams using graph transformations
Spectral techniques have found many applications in computeraided design, including synthesis, verification, and testing. Decision diagram representations permit spectral coeffici...
Whitney J. Townsend, Mitchell A. Thornton, Rolf Dr...
KR
1994
Springer
14 years 23 days ago
Modalities Over Actions, I. Model Theory
This paper analyzes a language for actions and the deontic modalities over actions -- i.e., the modalities permitted, forbidden and obligatory. The work is based on: (1) an action...
L. Thorne McCarty