/usr/lib/swipl/library/clp/clpb.pl
AllApplicationManualNameSummaryHelp

  • library
    • clp
      • clpfd.pl -- CLP(FD): Constraint Logic Programming over Finite Domains
      • clpb.pl -- CLP(B): Constraint Logic Programming over Boolean Variables
        • sat/1
        • taut/2
        • labeling/1
        • sat_count/2
        • random_labeling/2
        • weighted_maximum/3
 random_labeling(+Seed, +Vs) is det
Select a single random solution. An admissible assignment of truth values to the Boolean variables in Vs is chosen in such a way that each admissible assignment is equally likely. Seed is an integer, used as the initial seed for the random number generator.