/usr/share/swi-prolog/pack/clpBNR/prolog/clpBNR.pl
All Application Manual Name SummaryHelp

  • prolog
    • clpBNR.pl -- clpBNR: Constraint Logic Programming over Continuous Domain of Reals
      • clpStatistics/0
      • clpStatistic/1
      • clpStatistics/1
      • list/1
      • interval/1
      • interval_degree/2
      • nb_setbounds/2
      • range/2
      • domain/2
      • delta/2
      • midpoint/2
      • median/2
      • lower_bound/1
      • upper_bound/1
      • ::/2
      • {}/1
      • watch/2
      • trace_clpBNR/1
 lower_bound(?X:numeric) is semidet
Succeeds if X is numeric and unifies with the lower bound of its domain. Examples:
?- X::integer(1,10),lower_bound(X).
X = 1.

?- X = 42, lower_bound(X).
X = 42.

Note that lower_bound will unify X with a number on success, but it may fail if this value is inconsistent with current constraints.