Sciweavers

532 search results - page 64 / 107
» The Logic of Quasi-MV Algebras
Sort
View
ACL2
2006
ACM
14 years 3 months ago
Unique factorization in ACL2: Euclidean domains
ACL2 is used to systematically study domains whose elements can be “uniquely” factored into products of “irreducible” elements. The best known examples of such domains are...
John R. Cowles, Ruben Gamboa
EURODAC
1994
IEEE
122views VHDL» more  EURODAC 1994»
14 years 2 months ago
Compiled-code-based simulation with timing verification
Due to the complexity of today's systems, prototyping by simulation must be based on simulation-engine-like performance. It is proved by implementations that compiler-driven ...
Winfried Hahn, Andreas Hagerer, C. Herrmann
ASPDAC
2005
ACM
97views Hardware» more  ASPDAC 2005»
13 years 12 months ago
Fast synthesis of exact minimal reversible circuits using group theory
- We present fast algorithms to synthesize exact minimal reversible circuits for various types of gates and costs. By reducing reversible logic synthesis problems to group theory p...
Guowu Yang, Xiaoyu Song, William N. N. Hung, Marek...
FUIN
2007
92views more  FUIN 2007»
13 years 9 months ago
Foundations of Modal Deductive Databases
We give formulations for modal deductive databases and present a modal query language called MDatalog. We define modal relational algebras and give the seminaive evaluation algor...
Linh Anh Nguyen
SYNTHESE
2008
88views more  SYNTHESE 2008»
13 years 9 months ago
Interpolation in computing science: the semantics of modularization
The Interpolation Theorem, first formulated and proved by W. Craig fifty years ago for predicate logic, has been extended to many other logical frameworks and is being applied in s...
Gerard R. Renardel de Lavalette