1943 search results - page 72 / 389 » Ordering Default Theories |
ORDER
2007
14 years 11 months ago
2007
Abstract. We analyze results on well-partial-orderings from the viewpoint of computability theory, and we answer a question posed by Diana Schmidt. We obtain the following results....
AAAI
1990
15 years 1 months ago
1990
Reasoning about causality is an interesting application area of formal nonmonotonic theories. Here we focus our attention on a certain aspect of causal reasoning, namely causaZ as...
112
click to vote
JCP
2007
14 years 11 months ago
2007
Abstract— This paper deals with the use of Bayesian Networks to compute system reliability of complex systems under epistemic uncertainty. In the context of incompleteness of rel...
115
click to vote
TYPES
1994
Springer
15 years 3 months ago
1994
Springer
A special final coalgebra theorem, in the style of Aczel's [2], is proved within standard Zermelo-Fraenkel set theory. Aczel's AntiFoundation Axiom is replaced by a varia...
ICIP
2005
IEEE
16 years 1 months ago
2005
IEEE
We provide a new comparison between hexagonal and orthogonal lattices, based on approximation theory. For each of the lattices, we select the "natural" spline basis func...