4066 search results - page 177 / 814 » Almost Complete Sets |
179
click to vote
ITCC
2003
IEEE
15 years 11 months ago
2003
IEEE
Real-time applications often have mixed hard and soft deadlines, can be preempted subject to the cost of context switching or the restart of computation, and have various data dep...
167
click to vote
ICANN
2009
Springer
16 years 1 months ago
2009
Springer
We propose to model human reasoning tasks using completed logic programs interpreted under the three-valued Lukasiewicz semantics. Given an appropriate immediate consequence operat...
135
click to vote
VTS
2003
IEEE
15 years 11 months ago
2003
IEEE
This paper improves upon the state of the art in testing word oriented memories. It first presents a complete set of fault models for intra-word coupling faults. Then, it establi...
162
click to vote
ICLP
2003
Springer
15 years 11 months ago
2003
Springer
Abstract. We extend Clark’s definition of a completed program and the definition of a loop formula due to Lin and Zhao to disjunctive logic programs. Our main result, generaliz...
149
click to vote
FSTTCS
1993
Springer
15 years 10 months ago
1993
Springer
Abstract. We provide a complete system of transformation rules for semantic unification with respect to theories defined by convergent rewrite systems. We show that this standard u...