769 search results - page 73 / 154 » Where Is the Proof |
ECAI
1998
Springer
14 years 1 months ago
1998
Springer
In this paper we describe an approach for integrating abduction and induction in the ILP setting of learning from interpretations with the aim of solving the problem of incomplete...
CCL
1994
Springer
14 years 1 months ago
1994
Springer
We introduce a modular property of equational proofs, called modularity of normalization, for the union of term rewrite systems with shared symbols. The idea is, that every normali...
STOC
1992
ACM
14 years 28 days ago
1992
ACM
Abstract. We describe two methods for estimating the size and depth of decision trees where a linear test is performed at each node. Both methods are applied to the question of dec...
FOCS
1990
IEEE
14 years 28 days ago
1990
IEEE
The exponent of periodicity is an important factor in estimates of complexity of word-unification algorithms. We prove that the exponent of periodicity of a minimal solution of a w...
CCA
2009
Springer
14 years 27 days ago
2009
Springer
We investigate the relationship between computable metric spaces (X, d, ) and (X, d, ), where (X, d) is a given metric space. In the case of Euclidean space, and are equivalent u...