3845 search results - page 550 / 769 » Belief Logic Programming |
184
click to vote
FOIKS
2008
Springer
15 years 8 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...
181
click to vote
CORR
2006
Springer
15 years 6 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...
158
click to vote
ESOP
2012
Springer
14 years 2 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...
173
click to vote
ICFP
2004
ACM
16 years 6 months ago
2004
ACM
Useful type inference must be faster than normalization. Otherwise, you could check safety conditions by running the program. We analyze the relationship between bounds on normali...
181
click to vote
POPL
2010
ACM
16 years 4 months ago
2010
ACM
We present a verified compiler to an idealized assembly language from a small, untyped functional language with mutable references and exceptions. The compiler is programmed in th...