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().Write a predicate start that removes any existing primes and leaves prolog in a state such that primes(X) returns X = .
Can anyone enlighten me? Thanks!
No replies to this topic
1 user(s) are reading this topic
0 members, 1 guests, 0 anonymous users