4192 search results - page 269 / 839 » Probabilistic Logic Programming |
172
click to vote
BIRTHDAY
2010
Springer
15 years 7 months ago
2010
Springer
Stable models of logic programs have been studied by many researchers, mainly because of their role in the foundations of answer set programming. This is a review of some of the de...
275
click to vote
POPL
2004
ACM
16 years 6 months ago
2004
ACM
We present a notion of -long ? -normal term for the typed lambda calculus with sums and prove, using Grothendieck logical relations, that every term is equivalent to one in norm...
189
click to vote
LFCS
2007
Springer
16 years 21 days ago
2007
Springer
Abstract. In order to verify programs with pointer variables, we introduce a temporal logic LTLmem whose underlying assertion language is the quantifier-free fragment of separatio...
164
click to vote
GCC
2003
Springer
15 years 11 months ago
2003
Springer
This paper introduces a method for automatic composition of semantic web services using linear logic theorem proving. The method uses semantic web service language (DAML-S) for ext...
161
click to vote
ENTCS
2006
15 years 6 months ago
2006
We introduce a rewrite-based specification language for modelling probabilistic concurrent and distributed systems. The language, based on PMaude, has both a rigorous formal basis...