2911 search results - page 379 / 583 » A Logic of Graph Constraints |
166
click to vote
ICAI
2004
15 years 8 months ago
2004
This paper shows how to generate an English step-by-step explanation that describes how an automated reasoning system solves a complex logic program. We limit our attention to pro...
176
click to vote
JNSM
2008
15 years 6 months ago
2008
There is a large conceptual gap between end-to-end infrastructure requirements and detailed component configuration implementing those requirements. Today, this gap is manually br...
153
click to vote
DAC
2005
ACM
16 years 7 months ago
2005
ACM
We present an efficient search strategy for satisfiability checking on circuits represented at the register-transfer-level (RTL). We use the RTL circuit structure by extending con...
167
click to vote
SIGSOFT
2005
ACM
16 years 7 months ago
2005
ACM
We present a technique that enables the use of finite model finding to check the satisfiability of certain formulas whose intended models are infinite. Such formulas arise when us...
170
click to vote
HPCA
2004
IEEE
16 years 6 months ago
2004
IEEE
Design of wakeup-free issue queues is becoming desirable due to the increasing complexity associated with broadcast-based instruction wakeup. The effectiveness of most wakeup-free...