7 search results - page 1 / 2 » A fast algorithm and datalog inexpressibility for temporal r... |
TOCL
2010
13 years 3 months ago
2010
KR
2000
Springer
13 years 8 months ago
2000
Springer
When reasoning in description, modal or temporal logics it is often useful to consider axioms representing universal truths in the domain of discourse. Reasoning with respect to a...
WSCG
2001
13 years 6 months ago
2001
This paper presents a fast disparity analysis approach based on a hybrid block- and pixel-recursive matching scheme. The key idea is to choose efficiently a small number of candid...
PLDI
2009
ACM
13 years 11 months ago
2009
ACM
We show that recursive programs where variables range over finite domains can be effectively and efficiently analyzed by describing the analysis algorithm using a formula in a ...
ESANN
2000
13 years 6 months ago
2000
Abstract. For a network of spiking neurons with reasonable postsynaptic potentials, we derive a supervised learning rule akin to traditional error-back-propagation, SpikeProp and s...