605 search results - page 78 / 121 » Dealing with logical omniscience |
SCCC
1998
IEEE
14 years 1 months ago
1998
IEEE
The last few years have seen a renewal of interest in the consideration of dynamic programming in compiler technology. This is due to the compactness of the representations, which...
FPGA
1998
ACM
14 years 1 months ago
1998
ACM
Current reconfigurable systems suffer from a significant overhead due to the time it takes to reconfigure their hardware. In order to deal with this overhead, and increase the com...
TYPES
1998
Springer
14 years 1 months ago
1998
Springer
Investigating soundness and completeness of verification calculi for imperative programming languages is a challenging task. Incorrect results have been published in the past. We t...
ICCAD
1996
IEEE
14 years 1 months ago
1996
IEEE
We propose a new method for generating BDDs from hardware algorithm descriptions written in a programming language. Our system can deal with control structures, such as conditiona...
TIME
1994
IEEE
14 years 29 days ago
1994
IEEE
We describe in this article an abductive procedure based on a constrained resolution principle. The choice of constrained resolution is motivated by the whish to gain full advanta...