anthem/examples/prime.lp

#show prime/1.
#external integer(n(0)).

composite(I * J) :- I = 2..n, J = 2..n.
prime(N) :- N = 2..n, not composite(N).
Add example program for prime number detection 2018-04-11 21:42:08 +02:00			`#show prime/1.`
Reimplement integer variable detection This is a reimplementation of the integer variable detection procedure. The idea is to iteratively assume variables to be noninteger, and to prove that this would lead to a false or erroneous result. If the proof is successful, the variable is integer as a consequence. 2018-04-20 16:12:54 +02:00			`#external integer(n(0)).`
Add example program for prime number detection 2018-04-11 21:42:08 +02:00
			`composite(I * J) :- I = 2..n, J = 2..n.`
			`prime(N) :- N = 2..n, not composite(N).`