package libzipperposition

  1. Overview
  2. Docs
On This Page
  1. Weight functions
Library for Zipperposition

Install 

dune-project
 Dependency

github.com Readme Changelog Edit opam file Versions (4)

Authors

  1. S
    Simon Cruanes

Maintainers

  1. S
    simon.cruanes.2007@m4x.org

Sources

1.5.1.tar.gz
md5=cc320f66f10555c54822da624419e003
sha512=f8d5f7a5ae790bf0388d74261673803cf375f91f92f7b413b70db1ce5841ef55343a208f98727c8551d66f1840ab892f1c0c943a34861d14d79ce469b235a2f2

doc/libzipperposition.calculi/Libzipperposition_calculi/Superposition/Make/argument-1-Env/ProofState/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

val combine : (t * int) list -> t

Combine a list of pairs w, coeff where w is a weight function, and coeff a strictly positive number. This is a weighted sum of weights.