recategorized by
1,270 views
3 votes
3 votes

Which one of the following is the correct implementation of the meta-predicate “not” in PROLOG (Here G represents a goal)?

  1. not(G):- !, call(G), fail. not(G).
  2. not(G):- call(G), !, fail. not(G).
  3. not(G):- call(G), fail, !, not(G).
  4. not(G):- call(G), !, fail.not(G):- !.
recategorized by

Please log in or register to answer this question.

Answer:

Related questions

2 votes
2 votes
1 answer
2
go_editor asked Jul 19, 2016
3,130 views
The map colouring problem can be solved using which of the following technique?Means-end analysisConstraint satisfactionAO* searchBreadth first search
1 votes
1 votes
3 answers
3
makhdoom ghaya asked Oct 4, 2016
4,092 views
Which formal system provides the semantic foundation for Prolog ?Predicate calculusLambda calculusHoare logicPropositional logic
3 votes
3 votes
2 answers
4
go_editor asked Jul 19, 2016
12,552 views
Which of the following is a knowledge representation technique used to represent knowledge about stereotype situation?Semantic networkFramesScriptsConceptual Dependency