4218 search results - page 315 / 844 » Complete sets of cooperations |
190
Voted
ICLP
2004
Springer
16 years 24 days ago
2004
Springer
The extended answer set semantics for logic programs allows for the defeat of rules to resolve contradictions. We propose a refinement of these semantics based on a preference rel...
147
click to vote
DATE
2003
IEEE
16 years 22 days ago
2003
IEEE
We investigate a characterization of hard-to-detect bridging faults. For circuits with large numbers of lines (or nodes), this characterization can be used to select target faults...
189
click to vote
VTS
2003
IEEE
16 years 21 days ago
2003
IEEE
Irreversible computation necessarily results in energy dissipation due to information loss. While small in comparison to the power consumption of today’s VLSI circuits, if curre...
199
Voted
JSYML
2008
15 years 7 months ago
2008
In 2004 Csima, Hirschfeldt, Knight, and Soare [1] showed that a set A T 0 is nonlow2 if and only if A is prime bounding, i.e. for every complete atomic decidable theory T , there i...
168
click to vote
PTS
2010
15 years 5 months ago
2010
This paper addresses the challenge of generating test sets that achieve functional coverage, in the absence of a complete specification. The inductive testing technique works by p...