Equational Logic Programming

Rakesh Verma, Ph.D.
Associate Professor, Department of Computer Science
University of Houston
CS Faculty Candidate

March 16, 2001
11 a.m.
Fuller Laboratories (FL 311)

Abstract

LRR is an equational logic programming system developed at the University of Houston that allows tabled as well as untabled reductions. LRR makes natural high-level specifications feasible for many applications, besides serving as a testbed for innovating fast, practical reduction algorithms.

In this talk, I will first introduce equational logic programming and the LRR system, including the tabling mechanism of LRR. Next, I will present some of the optimization techniques that give LRR its efficiency. Many of these techniques are applicable to other symbolic computing systems as well. Finally, I will discuss some applications of LRR to theorem proving and automatic verification, e.g., to model checking.

Host

Professor Micha Hofri

Maintained by webmaster@wpi.edu
Last modified: Sep 27, 2006, 16:05 EDT