Abstract. In this paper we present a comparison of several inductive programming (IP) systems. IP addresses the problem of learning (recursive) programs from incomplete specificati...
Martin Hofmann 0008, Emanuel Kitzelmann, Ute Schmi...
Abstract. We provide a complete system of transformation rules for semantic unification with respect to theories defined by convergent rewrite systems. We show that this standard u...
Semantics for a Higher-Order Functional Language with Logic Variables Radha Jagadeesan Imperial College, London, UK SW7 2BZ. Keshav Pingali Cornell University, Ithaca, NY 14853. A...
Higher-order recursion schemes are systems of rewrite rules on typed non-terminal symbols, which can be used to define infinite trees. The Global Modal Mu-Calculus Model Checking...
Abstract. We use a simple yet powerful higher-order conditional random field (CRF) to model optical flow. It consists of a standard photoconsistency cost and a prior on affine mo...