3845 search results - page 309 / 769 » Belief Logic Programming |
174
click to vote
CADE
2008
Springer
16 years 7 months ago
2008
Springer
Abstract. A proof method is described which combines compositional proofs of interleaved parallel programs with the intuitive and highly automatic strategy of symbolic execution. A...
168
click to vote
SAC
2010
ACM
16 years 1 months ago
2010
ACM
We introduce an extension of linear constraints, called linearrange constraints, which allows for (meta-)reasoning about the approximation width of variables. Semantics for linear...
174
Voted
AAAI
2006
15 years 8 months ago
2006
A novel and simple combination of inductive logic programming with kernel methods is presented. The kFOIL algorithm integrates the well-known inductive logic programming system FO...
176
Voted
JMLR
2006
15 years 6 months ago
2006
We develop kernels for measuring the similarity between relational instances using background knowledge expressed in first-order logic. The method allows us to bridge the gap betw...
181
click to vote
FLOPS
1999
Springer
15 years 11 months ago
1999
Springer
Abstract. Subtyping tends to undermine the effects of parametric polymorphism as far as the static detection of type errors is concerned. Starting with this observation we present...