Sciweavers

2076 search results - page 80 / 416
» Functional logic overloading
Sort
View
JSYML
2008
86views more  JSYML 2008»
13 years 8 months ago
On Skolemization in constructive theories
In this paper a method for the replacement, in formulas, of strong quantifiers by functions is introduced that can be considered as an alternative to Skolemization in the setting ...
Matthias Baaz, Rosalie Iemhoff
ENTCS
2006
176views more  ENTCS 2006»
13 years 8 months ago
Automatic Formal Synthesis of Hardware from Higher Order Logic
A compiler that automatically translates recursive function definitions in higher order logic to clocked synchronous hardware is described. Compilation is by mechanised proof in t...
Mike Gordon, Juliano Iyoda, Scott Owens, Konrad Sl...
ICCAD
1993
IEEE
81views Hardware» more  ICCAD 1993»
14 years 28 days ago
Inverter minimization in multi-level logic networks
In this paper, we look at the problem of inverter minimization in multi-level logic networks. The network is specified in terms of a set of base functions and the inversion opera...
Alok Jain, Randal E. Bryant
DAC
2005
ACM
14 years 9 months ago
A new canonical form for fast boolean matching in logic synthesis and verification
? An efficient and compact canonical form is proposed for the Boolean matching problem under permutation and complementation of variables. In addition an efficient algorithm for co...
Afshin Abdollahi, Massoud Pedram
HIM
1997
Springer
162views Multimedia» more  HIM 1997»
14 years 29 days ago
Probabilistic Logical Information Retrieval for Content, Hypertext, and Database Querying
Classical retrieval models support content-oriented searching for documents using a set of words as data model. However, in hypertext and database applications we want to consider...
Thomas Rölleke, Markus Blömer