283 search results - page 31 / 57 » Extracting Program Logics From Abstract Interpretations Defi... |
ENTCS
2006
13 years 7 months ago
2006
The goal of this paper is to translate (fragments of) the quantified discrete duration calculus QDDC, proposed by P. Pandya, into symbolic acceptors with counters. Acceptors are w...
ILP
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. Many reinforcement learning domains are highly relational. While traditional temporal-difference methods can be applied to these domains, they are limited in their capaci...
SCCC
1998
IEEE
13 years 12 months ago
1998
IEEE
The last few years have seen a renewal of interest in the consideration of dynamic programming in compiler technology. This is due to the compactness of the representations, which...
LPNMR
2009
Springer
14 years 2 months ago
2009
Springer
Abstract. We study the complexity of consistency checking and query answering on incomplete databases for languages ranging from non-recursive Datalog to disjunctive Datalog with n...
DAWAK
2000
Springer
14 years 22 hour ago
2000
Springer
In the context of multidimensional databases implemented on relational DBMSs through star schemes, the most effective technique to enhance performances consists of materializing re...