An algorithm is described which computes stable models of propositional logic programs with negation as failure using the Assumption Based Truth Maintenance mechanism. Since stabl...
Abstract. We present a separation logic framework which can express properties of memory separation between different points in a program. We describe an algorithm based on this fr...
Mohammad Raza, Cristiano Calcagno, Philippa Gardne...
We present a compositional program logic for call-by-value imperative higher-order functions with general forms of aliasing, which can arise from the use of reference names as fun...
We consider random logic programs with two-literal rules and study their properties. In particular, we obtain results on the probability that random “sparse” and “dense” pr...