393 search results - page 43 / 79 » Logic Programs with Classical Negation |
ECCV
2006
Springer
15 years 11 months ago
2006
Springer
Non-negative tensor factorization (NTF) has recently been proposed as sparse and efficient image representation (Welling and Weber, Patt. Rec. Let., 2001). Until now, sparsity of t...
112
click to vote
IGPL
2006
14 years 9 months ago
2006
Abstract. This paper addresses the problem of establishing temporal properties of programs written in languages, such as Java, that make extensive use of the heap to allocate-and d...
WDAG
2007
Springer
15 years 3 months ago
2007
Springer
Abstract. We examine the problem of detecting nested temporal predicates given the execution trace of a distributed program. We present a technique that allows efficient detection ...
111
click to vote
AIIA
2005
Springer
15 years 3 months ago
2005
Springer
Machine Learning systems are often distinguished according to the kind of representation they use, which can be either propositional or first-order logic. The framework working wi...
111
click to vote
COMPASS
1994
15 years 1 months ago
1994
We give a notation and a logical calculus for the description and deductive manipulation of dynamic networks of communicating components. We represent such nets by hierarchical sys...