3513 search results - page 489 / 703 » Super Logic Programs |
113
Voted
APLAS
2006
ACM
15 years 6 months ago
2006
ACM
We present a local relational reasoning method for reasoning about contextual equivalence of expressions in a λ-calculus with recursive types and general references. Our developme...
101
Voted
SAC
2006
ACM
15 years 6 months ago
2006
ACM
We provide sufficient conditions that formally guarantee that the floating-point computation of a polynomial evaluation is faithful. To this end, we develop a formalization of ...
155
Voted
IDA
2005
Springer
15 years 6 months ago
2005
Springer
Abstract. This paper introduces Higher-Order Bayesian Networks, a probabilistic reasoning formalism which combines the efficient reasoning mechanisms of Bayesian Networks with the...
RULEML
2005
Springer
15 years 6 months ago
2005
Springer
In this paper we argue that a realistic architecture for the Semantic Web must be based on multiple independent, but interoperable, stacks of languages. In particular, we argue tha...
117
click to vote
TACAS
2005
Springer
15 years 6 months ago
2005
Springer
Abstract. Symmetry reduction is a technique to combat the state explosion problem in temporal logic model checking. Its use with symbolic representation has suffered from the proh...