31 search results - page 4 / 7 » Abductive Inference in Probabilistic Logic Programs |
140
click to vote
KRDB
1996
15 years 3 months ago
1996
Metaprogramming adds new expressive power to logic programming which can be advantageous to transfer to the field of deductive databases. We propose metaprogramming as a way to mo...
214
click to vote
POPL
2009
ACM
16 years 2 months ago
2009
ACM
This paper describes a compositional shape analysis, where each procedure is analyzed independently of its callers. The analysis uses an abstract domain based on a restricted frag...
123
click to vote
JSC
2010
15 years 7 days ago
2010
We study the automated verification of pointer safety for heap-manipulating imperative programs with unknown procedure calls. Given a Hoare-style partial correctness specificati...
224
click to vote
POPL
2007
ACM
16 years 2 months ago
2007
ACM
In this paper, we propose a new algorithm for proving the validity or invalidity of a pre/postcondition pair for a program. The algorithm is motivated by the success of the algori...
125
Voted
ICLP
2010
Springer
15 years 5 months ago
2010
Springer
Abstract. There is currently a large interest in probabilistic logical models. A popular algorithm for approximate probabilistic inference with such models is Gibbs sampling. From ...