Sciweavers

3691 search results - page 220 / 739
» Bayesian Logic Programs
Sort
View
ACL
2009
15 years 4 months ago
Bayesian Unsupervised Word Segmentation with Nested Pitman-Yor Language Modeling
In this paper, we propose a new Bayesian model for fully unsupervised word segmentation and an efficient blocked Gibbs sampler combined with dynamic programming for inference. Our...
Daichi Mochihashi, Takeshi Yamada, Naonori Ueda
TLDI
2009
ACM
140views Formal Methods» more  TLDI 2009»
16 years 3 months ago
Design patterns in separation logic
Object-oriented programs are notable for making use of both rder abstractions and mutable, aliased state. Either feature alone is challenging for formal verification, and the com...
Neelakantan R. Krishnaswami, Jonathan Aldrich, Lar...
155
Voted
IJCAI
2007
15 years 7 months ago
ProbLog: A Probabilistic Prolog and Its Application in Link Discovery
We introduce ProbLog, a probabilistic extension of Prolog. A ProbLog program defines a distribution over logic programs by specifying for each clause the probability that it belo...
Luc De Raedt, Angelika Kimmig, Hannu Toivonen
CC
1998
Springer
134views System Software» more  CC 1998»
15 years 10 months ago
Flow Logics for Constraint Based Analysis
Abstract. Flow logic offers a compact and versatile notation for expressing the acceptability of solutions to program analysis problems. In contrast to previous logical formulation...
Hanne Riis Nielson, Flemming Nielson
POPL
2002
ACM
16 years 6 months ago
Proving correctness of compiler optimizations by temporal logic
Many classical compiler optimizations can be elegantly expressed using rewrite rules of form: I = I if , where I, I are intermediate language instructions and is a property expre...
David Lacey, Neil D. Jones, Eric Van Wyk, Carl Chr...