package libzipperposition
Library for Zipperposition
Install
Dune Dependency
Authors
Maintainers
Sources
1.5.1.tar.gz
md5=cc320f66f10555c54822da624419e003
sha512=f8d5f7a5ae790bf0388d74261673803cf375f91f92f7b413b70db1ce5841ef55343a208f98727c8551d66f1840ab892f1c0c943a34861d14d79ce469b235a2f2
doc/libzipperposition.calculi/Libzipperposition_calculi/Arith_int/Make/PS/CQueue/WeightFun/index.html
Module CQueue.WeightFun
Weight functions
type t = C.t -> int
attribute a weight to a clause. The smaller, the better (lightweight clauses will be favored). A weight must always be positive; the weight of the empty clause should alwyays be 0.
val default : t
Use Literal.heuristic_weight
val penalty : t
Returns the penalty of the clause
val favor_all_neg : t
Favor clauses with only negative ground lits
val favor_non_all_neg : t
Favor clauses that have at least one non-(ground negative) lit
val favor_ground : t
val favor_horn : t
val favor_goal : t
The closest a clause is from the initial goal, the lowest its weight. Some threshold is used for clauses that are too far away
sectionYPositions = computeSectionYPositions($el), 10)"
x-init="setTimeout(() => sectionYPositions = computeSectionYPositions($el), 10)"
>
On This Page