Global Utilities

Seminars - Abstract

Department of Computer Science & Computer Engineering

Topic:   PT - Resolution and Conditional Proof
Speaker:   Dr. Fei Liu
Date:   16-02-2004
Time:   01:00 AM
Venue:   BG 210
Abstract:   The seminar presents the framework of PT(CP) -resolution which is the unification of PT-resolution and conditional proof. PT-resolution is based on two set calculations - partial intersection and truncation. It is monotonic, and it prevents derivations on logic programs which have a finite universe, from infinite recursion. In other words, a PT-derivation is always finite if the universe of the program is finite. The integration of PT-resolution and conditional proof (PT(CP) - resolution) will resume a derivation in the situation that the derivation is terminated before a query is answered.
Content Approved by: Head of School
Page maintained by: Applications Programmer
Last Updated: 14 October, 2009