Abstract. In this paper we explore the “for large enough” quantifier, also known as “all but finitely many”, which plays a central role in asymptotic reasoning, as used f...
In many systems, items of information have owners associated with them. An owner of an item of information may want the system to enforce a policy that restricts use of that infor...
Abstract. Higher-order representation techniques allow elegant encodings of logics and programming languages in the logical framework LF, but unfortunately they are fundamentally i...
We present a foundation for a computational meta-theory of languages with bindings implemented in a computer-aided formal reasoning environment. Our theory provides the ability to...
Aleksey Nogin, Alexei Kopylov, Xin Yu, Jason Hicke...
We present the first temporal-difference learning algorithm for off-policy control with unrestricted linear function approximation whose per-time-step complexity is linear in the ...