BDDs and their algorithms implement a decision procedure for Quanti ed Propositional Logic. BDDs are a kind of acyclic automata. Unrestricted automata (recognizing unbounded string...
The method of logical relations assigns a relational interpretation to types that expresses operational invariants satisfied by all terms of a type. The method is widely used in ...
Upper and lower conditional probabilities assigned by Hausdorff outer and inner measures are given; they are natural extensions to the class of all subsets of Ω=[0,1] of finite...
Polynomial interpretations are a useful technique for proving termination of term rewrite systems. In an automated setting, termination tools are concerned with parametric polynomi...
Friedrich Neurauter, Aart Middeldorp, Harald Zankl
Abstract. In update logic the interpretation of an action is often assumed to be independent from the agents’ beliefs about the situation (see [BMS04] or [Auc05]). In this paper ...