4192 search results - page 125 / 839 » Probabilistic Logic Programming |
109
click to vote
APLAS
2007
ACM
15 years 6 months ago
2007
ACM
Abstract. This paper provides a call-by-name and a call-by-value calculus, both of which have a Curry-Howard correspondence to the minimal normal logic K. The calculi are extension...
109
Voted
IPL
2006
15 years 2 months ago
2006
We investigate determining the exact bounds of the frequencies of conjunctions based on frequent sets. Our scenario is an important special case of some general probabilistic logi...
124
click to vote
LPNMR
2005
Springer
15 years 7 months ago
2005
Springer
We investigate techniques for approximating answer sets of general logic programs of Lifschitz and Woo, whose rules have single literals as heads. We propose three different method...
135
Voted
POPL
2010
ACM
15 years 11 months ago
2010
ACM
The method of logical relations is a classic technique for proving the equivalence of higher-order programs that implement the same observable behavior but employ different intern...
109
click to vote
DALT
2006
Springer
15 years 6 months ago
2006
Springer
We outline elements of the Abstract Contract Calculator, a prototype language implemented in Haskell (a declarative programming language) in which we simulate agents executing abst...