Sciweavers

106 search results - page 11 / 22
» A logic you can count on
Sort
View
JAPLL
2006
114views more  JAPLL 2006»
14 years 9 months ago
The monadic second-order logic of graphs XV: On a conjecture by D. Seese
A conjecture by D. Seese states that if a set of graphs has a decidable monadic second-order theory, then it is the image of a set of trees under a transformation defined by monad...
Bruno Courcelle
ERSA
2003
118views Hardware» more  ERSA 2003»
14 years 11 months ago
A Novel Multi-Speed, Power Saving Architecture for SiGe HBT FPGA
The availability of SiGe HBT devices has opened a door for Gigahertz FPGAs. However, the large device power consumption limits its scale. In order to solve this problem, a Multipl...
Jong-Ru Guo, Chao You, Michael Chu, Kuan Zhou, You...
GLVLSI
2007
IEEE
139views VLSI» more  GLVLSI 2007»
15 years 4 months ago
Synthesis of irregular combinational functions with large don't care sets
A special logic synthesis problem is considered for Boolean functions which have large don’t care sets and are irregular. Here, a function is considered as irregular if the inpu...
Valentin Gherman, Hans-Joachim Wunderlich, R. D. M...
JAPLL
2008
76views more  JAPLL 2008»
14 years 9 months ago
The many faces of counts-as: A formal analysis of constitutive rules
Abstract. The paper proposes a logical systematization of the notion of countsas which is grounded on a very simple intuition about what counts-as statements actually mean, i.e., f...
Davide Grossi, John-Jules Ch. Meyer, Frank Dignum
ACMSE
2000
ACM
15 years 2 months ago
Exploring an information-based approach to computation and computational complexity
We present the background and justi cation for a new approachto studying computation and computational complexity. We focus on categories of problems and categories of solutions w...
D. E. Stevenson