hought of as abstract interpretation for the heap How we talk about the heap Program var X points to U that has an N field pointing to V We use first order predicate logic ¡...
In this paper we further develop the methodology of temporal logic as an executable imperative language, presented by Moszkowski [Mos86] and Gabbay [Gab87, Gab89] and present a con...
Howard Barringer, Michael Fisher, Dov M. Gabbay, G...
This paper is an analysis of two knowledge representation extensions of logic programming, namely Answer Set Programming and ID-Logic. Our aim is to compare both logics on the leve...
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...
A prospective study of the use of ordered multi-lattices as underlying sets of truth-values for a generalised framework of logic programming is presented. Specifically, we investi...