Jump to content


Prolog Question


  • You cannot reply to this topic
No replies to this topic

#1 student

    New Member

  • Members
  • Pip
  • 1 posts

Posted 31 March 2005 - 03:23 AM

Hi, I have just pick up this language and still learning the basics of it. I happened to came across a prolog question:

"To get started We need to assert primes([2]).Write a predicate start that removes any existing primes and leaves prolog in a state such that primes(X) returns X = [2].

Can anyone enlighten me? Thanks!





1 user(s) are reading this topic

0 members, 1 guests, 0 anonymous users