Peter.Andrews@A.CS.CMU.EDU (10/06/86)
The following talk will be given in the Seminar on Automated Reasoning Wednesday, Oct. 15, at 4:30p.m. in room PH125C. The talk is independent of preceding material in the seminar. Prolog without Horns D. W. Loveland An extension to Prolog is defined that handles non-Horn clause sets (programs) in a manner closer to standard Prolog than previously proposed. Neither the negation symbol or a symbol for false are formally introduced in the system, although the system is conjectured to be propositionally complete. The intention of the extension is to provide processing of "nearly Horn" programs with minimal deviation from the Prolog format. Although knowledge of Prolog is not essential, some prior exposure to Prolog will be helpful.