UGC/CBSE NET SOLVED QUESTION PAPERS.(Computer Science)
Thursday 4 June 2015
Q67,Paper 3,j13 Which one of the following is a correct implementation of the meta- predicate “not” in PROLOG (Here G represents a goal) ?
(A) not(G):– !, call(G), fail.
not(G).
(B) not(G):– call(G), !, fail.
not(G).
(C) not(G):– call(G), fail, !.
not(G).
(D) not(G):– call(G), fail.
not(G):– !.
Answer B.
No comments:
Post a Comment
Note: only a member of this blog may post a comment.
Newer Post
Older Post
Home
Subscribe to:
Post Comments (Atom)
No comments:
Post a Comment
Note: only a member of this blog may post a comment.