1083 search results - page 70 / 217 » Using Contextual Logic Programming for Temporal Reasoning |
133
Voted
LICS
1994
IEEE
15 years 6 months ago
1994
IEEE
The theory of cut-free sequent proofs has been used to motivate and justify the design of a number of logic programming languages. Two such languages, Prolog and its linear logic ...
105
click to vote
ML
2000
ACM
15 years 2 months ago
2000
ACM
In this paper we present TDLEAF( ), a variation on the TD( ) algorithm that enables it to be used in conjunction with game-tree search. We present some experiments in which our che...
100
click to vote
DLOG
2003
15 years 3 months ago
2003
We consider the problem of automated index selection for embedded control programs (ECPs). Such systems have the property that the transaction types, which can consist of queries ...
118
Voted
ICML
1995
IEEE
16 years 3 months ago
1995
IEEE
The success ofreinforcement learninginpractical problems depends on the ability to combine function approximation with temporal di erence methods such as value iteration. Experime...
161
Voted
ICLP
1994
Springer
15 years 6 months ago
1994
Springer
In many cases, a logic program can be divided into two parts, so that one of them, the \bottom" part, does not refer to the predicates de ned in the \top" part. The \bot...