350 search results - page 4 / 70 » Branching Programs for Tree Evaluation |
LOPSTR
2009
Springer
13 years 12 months ago
2009
Springer
Abstract. We present a method based on logic program transformation, for verifying Computation Tree Logic (CTL∗ ) properties of finite state reactive systems. The finite state ...
NIPS
1993
13 years 6 months ago
1993
The game of Go has a high branching factor that defeats the tree search approach used in computer chess, and long-range spatiotemporal interactions that make position evaluation e...
ICLP
1992
Springer
13 years 9 months ago
1992
Springer
: Whiledecision tree compilationis a promisingway tocarry out guard tests e ciently, the methods given in the literature do not take into account either the execution characteristi...
ICALP
2009
Springer
14 years 3 days ago
2009
Springer
We consider the problem of constructing decision trees for entity identification from a given table. The input is a table containing information about a set of entities over a fi...
ECSQARU
1997
Springer
13 years 9 months ago
1997
Springer
Abstract. Temporal programming languages are recognized as natural and expressive formalisms for describing dynamic systems. However, most such languages are based on linear ow of ...