4218 search results - page 199 / 844 » Complete sets of cooperations |
ICANN
2009
Springer
14 years 5 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...
VTS
2003
IEEE
14 years 4 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...
ICLP
2003
Springer
14 years 4 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...
FSTTCS
1993
Springer
14 years 2 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...
COCOA
2008
Springer
14 years 17 days ago
2008
Springer
We consider the problem of minimizing the total weighted completion time on identical parallel machines when jobs have stochastic processing times and may arrive over time. We give...