J.C. Shepherson. Negation as failure II. Journal of Logic Programming, 2,3:185--202, 1985.  Home/Search   Document Not in Database   Summary   Related Articles

....[29] it is clear that the class of definite logic programs is well supported by Horn clause logic, which means that is well supported by first order logic. 9 2. 2 Normal Logic Programming In this section we introduce basic notions and results on normal logic programming (for further details see [2, 22, 35]) Normal programs over a signature Sigma (or normal Sigma programs) are sets of Sigma clauses called normal Sigma clauses where each Sigma literal in the body can be positive or negative. In the same way, normal Sigma goals are Sigma goal that can contain negative literals. Clearly, ....

....every clause in P is either an allowed clause or each variable that occurs in it, occurs in its head; ii) the clauses defining each positive literal occurring in G or in the body of a program clause are allowed; and (iii) G is allowed. Finally, we present an important result about floundering [23, 35]. Proposition 2 Suppose that P and G are allowed program and goal, respectively. Then (a) The computation of G w.r.t P does not flounder. b) Each computer answer of G w.r.t P is a ground substitution for var(G) 12 The problem of floundering was overcome by proposing an extension of negation ....

J.C. Shepherson. Negation as failure II. Journal of Logic Programming, 2,3:185--202, 1985.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC