1916 search results - page 185 / 384 » Reasoning with class algebra |
113
click to vote
TIME
2005
IEEE
15 years 9 months ago
2005
IEEE
We exploit the fact that qualitative Interval Algebra (IA) network problems are finite domain CSPs. In the first part of the paper, we show how to convert a qualitative IA network ...
127
click to vote
CSL
1999
Springer
15 years 8 months ago
1999
Springer
Abstract. We study a weakening of the notion of logical relations, called prelogical relations, that has many of the features that make logical relations so useful but having furth...
132
click to vote
AIPS
2008
15 years 6 months ago
2008
During the past few years, point-based POMDP solvers have gradually scaled up to handle medium sized domains through better selection of the set of points and efficient backup met...
133
click to vote
FORTE
2004
15 years 5 months ago
2004
Witnesses and counterexamples produced by model checkers provide a very useful source of diagnostic information. They are usually returned in the form of a single computation path ...
150
click to vote
ICRA
2010
IEEE
15 years 2 months ago
2010
IEEE
— We present an algorithm that probabilistically covers a bounded region of the state space of a nonlinear system with a sparse tree of feedback stabilized trajectories leading t...