Sciweavers

1916 search results - page 113 / 384
» Reasoning with class algebra
Sort
View
TARK
2009
Springer
15 years 7 months ago
Foundations of non-commutative probability theory
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 ...
Daniel Lehmann
FLOPS
2004
Springer
15 years 6 months ago
Relaxing the Value Restriction
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...
Jacques Garrigue
LPNMR
1990
Springer
15 years 4 months ago
The meaning of Negative Premises in Transition System Specifications
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 ...
Roland N. Bol, Jan Friso Groote
97
Voted
FQAS
2006
Springer
120views Database» more  FQAS 2006»
15 years 4 months ago
Question Answering with Imperfect Temporal Information
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...
Steven Schockaert, David Ahn, Martine De Cock, Eti...
87
Voted
DAGSTUHL
2008
15 years 2 months ago
Constraint Satisfaction Problems with Infinite Templates
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 ...
Manuel Bodirsky