1916 search results - page 138 / 384 » Reasoning with class algebra |
120
Voted
LOPSTR
1998
Springer
15 years 5 months ago
1998
Springer
Based on a variable-free combinatory form of definite clause logic programs we outline a methodology and supporting program environment CombInduce for inducing well-moded logic pro...
106
Voted
PLDI
1997
ACM
15 years 5 months ago
1997
ACM
We present a simple and novel framework for generating blocked codes for high-performance machines with a memory hierarchy. Unlike traditional compiler techniques like tiling, whi...
105
Voted
ECSQARU
2009
Springer
15 years 4 months ago
2009
Springer
In this paper, a new algebraic representation by the non-Archimedean fields is proposed to model stratified/ranked knowledge bases. The non-Archimedean representation is in the for...
120
Voted
ECSQARU
1995
Springer
15 years 4 months ago
1995
Springer
The paper presents a method for uncertainty propagation in Bayesian networks in symbolic, as opposed to numeric, form. The algebraic structure of probabilities is characterized. Th...
111
click to vote
FLOPS
2008
Springer
15 years 2 months ago
2008
Springer
Dependent types are useful for statically checking detailed specifications of programs and detecting pattern match or array bounds errors. We propose a novel approach to applicatio...