173 search results - page 9 / 35 » Basing Probabilistic Logic on Gambles |
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...
ECAI
2008
Springer
13 years 9 months ago
2008
Springer
Abstract. In this paper, we present a revision strategy of revising a conditional probabilistic logic program (PLP) when new information is received (which is in the form of probab...
ICLP
2004
Springer
14 years 28 days ago
2004
Springer
Abstract. In this paper we consider a logic programming framework for reasoning about imprecise probabilities. In particular, we propose a new semantics, for the Probabilistic Logi...
HIM
1997
Springer
13 years 11 months ago
1997
Springer
Classical retrieval models support content-oriented searching for documents using a set of words as data model. However, in hypertext and database applications we want to consider...
KR
2010
Springer
14 years 10 days ago
2010
Springer
We propose a new family of probabilistic description logics (DLs) that, in contrast to most existing approaches, are derived in a principled way from Halpern’s probabilistic fi...