1916 search results - page 113 / 384 » Reasoning with class algebra |
201
click to vote
TARK
2009
Springer
16 years 25 days ago
2009
Springer
Kolmogorov’s setting for probability theory is given an original generalization to account for probabilities arising from Quantum Mechanics. The sample space has a central role ...
152
click to vote
FLOPS
2004
Springer
15 years 11 months ago
2004
Springer
Restricting polymorphism to values is now the standard way to obtain soundness in ML-like programming languages with imperative features. While this solution has undeniable advant...
143
click to vote
LPNMR
1990
Springer
15 years 10 months ago
1990
Springer
We present a general theory for the use of negative premises in the rules of Transition System Specifications (TSSs). We formulate a criterion that should be satisfied by a TSS in ...
175
click to vote
FQAS
2006
Springer
15 years 10 months ago
2006
Springer
Abstract. A temporal question answering system must be able to deduce which qualitative temporal relation holds between two events, a reasoning task that is complicated by the fact...
146
click to vote
DAGSTUHL
2008
15 years 7 months ago
2008
Allowing templates with infinite domains greatly expands the range of problems that can be formulated as a non-uniform constraint satisfaction problem. It turns out that many CSPs ...