Implementation of Tabled LP Systems

Simple techniques for implementing tabled logic programming systems are being investigated in this project. Tabled LP systems are crucial for many important applications of logic programming (model checking, verification, non-monotonic reasoning). Recently, a new technique for implementing tabling based on dynamic reordering of alternatives has been proposed by us and implemented on top of the ALS commercial Prolog systems. Work is in progress to incorporate negation, cuts and parallelism.