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
  2. P
    Petar Vukmirovic
  3. A
    Alexander Bentkamp
  4. S
    Sophie Tourret
  5. V
    Visa Nummelin

Maintainers

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

Sources

2.0.tar.gz
md5=7a8e57388083ed763d12d18324c8a086
sha512=5c5ac312ada6b42907d1e91e349454a8375f7bf8165d3459721a40b707a840a3d6b3dc968a66f1040cb4de7aedf5c1c13f3e90b51337eae5ea6de41651d7bd63

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 of_string : string -> t

parse string description of weight function and return it

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 conj_relative : ?distinct_vars_mul:float -> ?parameters_magnitude:[< `Large | `Small Large ] -> ?goal_penalty:bool -> t
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.