4192 search results - page 586 / 839 » Probabilistic Logic Programming |
142
click to vote
FOIKS
2008
Springer
15 years 5 months ago
2008
Springer
Abstract. In this paper we recast the formalism of argumentation formalism known as DeLP (Defeasible Logic Programming) in game-theoretic terms. By considering a game between a Pro...
136
Voted
CORR
2006
Springer
15 years 3 months ago
2006
Springer
Following the ideas of the Remote Procedure Call model, we have developed a logic programming counterpart, naturally called Prolog Remote Predicate Call (Prolog RPC) [1]. The Prol...
127
click to vote
ESOP
2012
Springer
13 years 11 months ago
2012
Springer
The existing call-by-need λ calculi describe lazy evaluation via equational logics. A programmer can use these logics to safely ascertain whether one term is behaviorally equivale...
154
Voted
CSMR
2004
IEEE
15 years 7 months ago
2004
IEEE
Combining static and dynamic information is highly relevant in many reverse engineering, program comprehension and maintenance task. Dynamic analysis is particularly effective whe...
143
click to vote
CPAIOR
2008
Springer
15 years 5 months ago
2008
Springer
Abstract. The stochastic satisfiability modulo theories (SSMT) problem is a generalization of the SMT problem on existential and randomized (aka. stochastic) quantification over di...