1460 search results - page 17 / 292 » Preferential Description Logics |
140
click to vote
CSL
2010
Springer
15 years 5 months ago
2010
Springer
We study probabilistic complexity classes and questions of derandomisation from a logical point of view. For each logic L we introduce a new logic BPL, bounded error probabilistic ...
113
Voted
CSL
2000
Springer
15 years 9 months ago
2000
Springer
We study definability of languages in arithmetic and the free monoid by bounded versions of fixed-point and transitive-closure logics. In particular we give logical characterisat...
140
click to vote
EPIA
2007
Springer
15 years 11 months ago
2007
Springer
Abstract. The two puzzles are the Lottery Paradox and the Amalgamation Paradox, which both point out difficulties for aggregating uncertain information. A generalization of the lot...