<p>you can also have a look at section 3.3.2 of the following paper:</p>
<ul>
<li><a href="https://arxiv.org/abs/2008.06692" rel="nofollow noreferrer">https://arxiv.org/abs/2008.06692</a></li>
</ul>
<p>The method presented there allows you to compute <code>m</code> different stable models of a logic program by finding <code>m</code> <code>1</code>-diverse stable models. But note that <code>m</code> has to be given as input, hence the method is not directly applicable to the problem of computing one stable model that contains all stable models of a logic program.</p>
Gather all answer sets into one answer set (ASP)
<p>my question is, if I can gather all answer sets into one answer. I attach the code below for my program. The results that it returns and a description of what I would like to have.</p>
<pre><code>% Main domain predicates definitions
argument(1..3).
element(1).


#show scope/2.

{scope(A, U) : element(U)}:- argument(A).
</code></pre>
<p>what I get is shown in the picture below</p>
<p><a href="https://i.stack.imgur.com/9Ir4p.png" rel="nofollow noreferrer"><img src="https://i.stack.imgur.com/9Ir4p.png" alt="enter image description here" /></a></p>
<p>But what I would like to get is, some predicate that has a unique id for each answer set. For example:</p>
<p>newScope(1,empty)-newScope(2,2,1)-newScope(3,3,1)-....-newScope(8,1,1)|newScope(8,2,1)|newScope(8,3,1)</p>
<p>thanks in advance to whomever has the patience to answer me.</p>