John C. Shepherdson

Learn More
The classic results of logic programming are based on an underlying equality relation of syntactic identity. Jaffar, Lassez and Maher [2] have shown how to extend these results, for definite clause programs, to other equality relations. We continue their development by showing how to deal with programs have negative literals in the bodies of clauses. We(More)