3047 search results - page 323 / 610 » On the Meaning of Logical Completeness |
187
click to vote
EKAW
2004
Springer
16 years 25 days ago
2004
Springer
Motivated by the need to extend features of semantic matchmaking between request and offer descriptions, a model is presented that exploits recently proposed non-standard inference...
200
click to vote
LOPSTR
2004
Springer
16 years 24 days ago
2004
Springer
We address the problem of an efficient rewriting strategy for general term rewriting systems. Several strategies have been proposed over the last two decades for rewriting, the mos...
204
click to vote
ISCAS
2003
IEEE
16 years 22 days ago
2003
IEEE
To handle today’s complexity, modern circuits and systems be specified at a high level of abstraction. Recently, SystemC has been proposed as a language that allows a fast on o...
208
click to vote
IDEAS
2002
IEEE
16 years 11 days ago
2002
IEEE
Boolean expression simplification is a well-known problem in the history of Computer Science. The problem of determining prime implicates from an arbitrary Boolean expression has...
178
Voted
FPL
2009
Springer
16 years 2 days ago
2009
Springer
Recent computing-oriented FPGAs feature DSP blocks including small embedded multipliers. A large integer multiplier, for instance for a double-precision floating-point multiplier...