4192 search results - page 682 / 839 » Probabilistic Logic Programming |
124
click to vote
FOSSACS
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. We present a realizability model for a call-by-value, higherorder programming language with parametric polymorphism, general first-class references, and recursive types....
119
click to vote
LICS
2007
IEEE
15 years 9 months ago
2007
IEEE
Set theories are traditionally based on first-order logic. We show that in a constructive setting, basing a set theory on a dependent logic yields many benefits. To this end, we...
106
click to vote
LICS
2007
IEEE
15 years 9 months ago
2007
IEEE
FreshML extends ML with constructs for declaring and ting abstract syntax trees that involve names and statically scoped binders. It is impure: name generation is an observable si...
125
click to vote
CSL
2007
Springer
15 years 9 months ago
2007
Springer
We consider the problem of automating and checking the use of previously proved lemmas in the proof of some main theorem. In particular, we call the collection of such previously p...
132
click to vote
EPIA
2007
Springer
15 years 9 months ago
2007
Springer
Recently, the logics of minimal knowledge and negation as failure MKNF [12] was used to introduce hybrid MKNF knowledge bases [14], a powerful formalism for combining open and clos...