Action formalisms like the fluent calculus have been developed to endow logic-based agents with the abilities to reason about the effects of actions, to execute high-level strateg...
Abstract. This paper introduces a higher-order lazy narrowing calculus (HOLN for short) that solves higher-order equations over the domain of simply typed λ-terms. HOLN is an exte...
The -calculus o ers an attractive basis for concurrent programming. It is small, elegant, and well studied, and supports via simple encodings a wide range of high-level constru...
Notions of program dependency arise in many settings: security, partial evaluation, program slicing, and call-tracking. We argue that there is a central notion of dependency commo...
Loop Calculus, introduced by Chertkov and Chernyak, is a new technique to incrementally improve approximations computed by Loopy Belief Propagation (LBP), with the ability to even...