We have as a bonus assignment to write the liars problem in programming with constraints (with prolog, in certain environments, ic, fd, swi-prolog, etc.)
We are given some txt files, with the input, which is of the form
,where claimI is a number, with i to run from 1 to N.
I read from the current file and I create a list, which the actual input in the predicate that solves the problem.
When I am trying to run in my laptop the problem for N = 10000, I am getting a stack overflow
> *** Overflow of the global/trail stack in spite of garbage collection!
> You can use the "-g kBytes" (GLOBALSIZE) option to have a larger stack.
> Peak sizes were: global stack 127040 kbytes, trail stack 4416 kbytes
I think that increasing the size of the stack will not get me far. Any ideas how to bypass the problem and take these measurements?