🚀 go-pugleaf

                                PH.D. STUDENT TALKS

                University at Albany - State University of New York

                            Computer Science Department

                                  Marlena Glaubitz

                  Tuesday, December 2, 1997, at 4:30p.m. in LI-98

                  Advanced topics in Prolog: Negation as Failure.

                                      Abstract

                 Prolog programs can be thought of as logic  data  bases
            consisting of sets of clauses.  The ground clauses in a data
            base create a set of instances of the data  base  relations.
            The  remaining  clauses  are  the  general rules of the data
            base. A data base such as  this  only  contains  information
            about true instances of relations.  Therefore, only positive
            information can be a logical consequence of a program.

                 In this talk, I will discuss the  negation  as  failure
            rule.  This rule is used to answer queries which make use of
            negation by showing  that  certain  relation  instances  are
            false.

            Reference:

            Clark, K. L., "Negation as failure", in Logic and Databases,
                 Gallaire,  H.  and  J.  Minker (eds), Plenum Press, New
                 York, 1978, 293-322.