84 search results - page 5 / 17 » Where We Stand at Probabilistic Reasoning |
KI
1999
Springer
13 years 11 months ago
1999
Springer
Computing least common subsumers in description logics is an important reasoning service useful for a number of applications. As shown in the literature, it can, for instance, be u...
LICS
2006
IEEE
14 years 1 months ago
2006
IEEE
We motivate and study a generic relaxation of correctness of reactive and concurrent systems with respect to a temporal specification. We define a system to be fairly correct if...
ICML
2003
IEEE
14 years 7 months ago
2003
IEEE
We present BL-WoLF, a framework for learnability in repeated zero-sum games where the cost of learning is measured by the losses the learning agent accrues (rather than the number...
TACAS
2010
Springer
13 years 4 months ago
2010
Springer
Abstract. We present a compositional verification technique for systems that exhibit both probabilistic and nondeterministic behaviour. We adopt an assume-guarantee approach to ver...
ICTAI
2008
IEEE
14 years 1 months ago
2008
IEEE
Constraint programming has been used in many applications where uncertainty arises to model safe reasoning. The goal of constraint propagation is to propagate intervals of uncerta...