K. Apt and R. Bol. Logic programming and negation. Journal of Logic Programming, 19/20:9-72, May/July 1994.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....canonical form, sub sort, value etc. as well as Prolog like predicates such as equality, set membership and the like will increase the amount of meta theory that can be formalized. Traditionally, negation as failure (NF ) 7] has been the overwhelmingly used approach in logic programming (see [2] for a recent survey) that is, infer :A if every proof of A fails nitely. The operational nature of this rule motivates the lack of a unique semantics and some of its related troublesome features: possible unsoundness, incompleteness and oundering. Furthermore, even if we manage to isolate a ....

K. Apt and R. Bol. Logic programming and negation. Journal of Logic Programming, 19/20:9-72, May/July 1994.

....canonical form, subsort, value etc. as well as Prolog like predicates such as equality, set membership and the like will increase the amount of meta theory that can be formalized. Traditionally, negation as failure (NF ) 5] has been the overwhelmingly used approach in logic programming (see [2] for a recent survey) that is, infer :A if every proof of A fails nitely. The operational nature of this rule motivates the lack of a unique semantics and some of its related troublesome features: possible unsoundness, incompleteness and oundering. Furthermore, even if we manage to isolate a ....

K. Apt and R. Bol. Logic programming and negation. Journal of Logic Programming, 19/20:9-72, May/July 1994.

No context found.

K. R. Apt, R. N. Bol. Logic Programming and Negation. A Survey, The Journal of Logic Programming 19:9-71 (1994).

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