Abstract: It is possible that a logic program has no finite complete sets of loops. For instance, the Hamiltonian circuit problem encoded by Nielemä is such a logic program. This means that the ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results