|
Left-sorted Bongard Problems have the keyword "allsorted" on the OEBP.
A Bongard Problem is labelled "allsorted" when the type of thing it sorts is partitioned unambiguously and without exception into two groups.
Similarly to using the precise and fuzzy keywords, calling a Bongard Problem "allsorted" is a subjective/intuitive judgment. The collection of all relevant potential examples is not clearly delineated anywhere.
(Sometimes it's ambiguous whether to consider certain examples that are ambiguously sorted relevant.)
The solution to an "allsorted" Bongard Problem can usually be re-phrased as "___ vs. not so" (see the keyword notso).
But not every "___ vs. not so" Bongard Problem should be labelled "allsorted"; there could be ambiguous border cases in a "___ vs. not so" Bongard Problem.
Bongard Problems in which the two sides are so different that there is no middle ground between them (keyword gap) are sometimes still labelled "allsorted", since the intuitive pool of all relevant examples just amounts to the two unrelated sides. But some "gap" Bongard Problems are not like that; for example sometimes there are more related classes of examples besides the two shown.
Sometimes the class of all examples in a Bongard Problem is imprecise, but, despite that, the rule sorting those examples is precise. Say, for some potential new example, it is unclear whether it should be included in the Bongard Problem at all, but, if it were included, it would be clear where it should be sorted. A Bongard Problem like this can still be tagged "allsorted".
On the other hand, sometimes the class of all examples is very clear, with an obvious boundary. (Keyword preciseworld.)
In deciding where to sort an example, we think about it until we come to a conclusion; an example isn't here considered ambiguous just because someone might have a hard time with it (keyword hardsort).
However, sometimes the way a Bongard Problem would sort certain examples is an unsolved problem in mathematics, and it may be unknown whether there is even a solution. Whether or not such a Bongard Problem should be labelled "allsorted" might be debated.
(See the keyword proofsrequired.)
One way to resolve this ambiguity is to redefine "allsorted" as meaning that once people decide where an example belongs, it will be on one of the two sides, and they will all agree about it.
There is a distinction to be made between a non-"allsorted" Bongard Problem that could be made "allsorted" by making (finitely many) more examples sorted (thereby modifying or clarifying the solution of the Bongard Problem) and one such that this is not possible while maintaining a comparably simple solution. The former kind would often be labelled precise, in particular when these border cases have been explicitly forbidden from being sorted in the Bongard Problem's definition.
For instance, discrete Bongard Problems that are not allsorted usually fall into the former category. | 
