804 search results - page 55 / 161 » On the Termination of the Chase Algorithm |
112
click to vote
TABLEAUX
2009
Springer
15 years 7 months ago
2009
Springer
Abstract. We give an optimal (exptime), sound and complete tableaubased algorithm for deciding satisfiability with respect to a TBox in the logic ALCI using global state caching. ...
106
Voted
CAV
2007
Springer
15 years 6 months ago
2007
Springer
Abstract. We present an extrapolation with care set operator to accelerate termination of reachability computation with polyhedra. At the same time, a counterexample guided refine...
83
Voted
ICIC
2005
Springer
15 years 6 months ago
2005
Springer
Abstract. An orthogonal forward selection (OFS) algorithm based on the leaveone-out (LOO) criterion is proposed for the construction of radial basis function (RBF) networks with tu...
99
Voted
NIPS
2003
15 years 1 months ago
2003
We consider the policy search approach to reinforcement learning. We show that if a “baseline distribution” is given (indicating roughly how often we expect a good policy to v...
SIAMCOMP
2008
15 years 13 days ago
2008
We consider a game-theoretical variant of the Steiner forest problem in which each player j, out of a set of k players, strives to connect his terminal pair (sj, tj) of vertices in...