/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
 clpStatistic(?S) is nondet
Succeeds if S unifies with a clpStatistic value; otherwise fails. On backtracking all values that unify with S will be generated. Examples:
?- clpStatistics, X::real, {X**4-4*X**3+4*X**2-4*X+3==0}, clpStatistic(narrowingOps(Ops)).
Ops = 2245,
X::real(-1.509169756145379, 4.18727500493995).

?- clpStatistics, X::real, {X**4-4*X**3+4*X**2-4*X+3==0}, clpStatistic(S).
S = userTime(0.02277600000000035),
X::real(-1.509169756145379, 4.18727500493995) ;
S = gcTime(0.0),
X::real(-1.509169756145379, 4.18727500493995) ;
S = globalStack(43696/524256),
X::real(-1.509169756145379, 4.18727500493995) ;
S = trailStack(664/133096),
X::real(-1.509169756145379, 4.18727500493995) ;
S = localStack(1864/118648),
X::real(-1.509169756145379, 4.18727500493995) ;
S = inferences(86215),
X::real(-1.509169756145379, 4.18727500493995) ;
S = narrowingOps(2245),
X::real(-1.509169756145379, 4.18727500493995) ;
S = narrowingFails(0),
X::real(-1.509169756145379, 4.18727500493995) ;
S = node_count(9),
X::real(-1.509169756145379, 4.18727500493995) ;
S = max_iterations(2245/3000),
X::real(-1.509169756145379, 4.18727500493995).