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/Fool/Make/argument-1-E/ProofState/CQueue/index.html
Module ProofState.CQueue
Priority queues on clauses
module WeightFun : sig ... end
val length : t -> int
Number of elements
val is_empty : t -> bool
check whether the queue is empty
val name : t -> string
Name of the implementation/role of the queue
Available Queues
val bfs : unit -> t
FIFO
val almost_bfs : unit -> t
Half FIFO, half default
val explore : unit -> t
Use heuristics for selecting "small" clauses
val ground : unit -> t
Favor positive unit clauses and ground clauses
val goal_oriented : unit -> t
custom weight function that favors clauses that are "close" to initial conjectures. It is fair.
val default : unit -> t
Obtain the default queue
val of_profile : Libzipperposition.ClauseQueue_intf.profile -> t
Select the queue corresponding to the given profile
IO
val pp : t CCFormat.printer
val to_string : t -> string
sectionYPositions = computeSectionYPositions($el), 10)"
x-init="setTimeout(() => sectionYPositions = computeSectionYPositions($el), 10)"
>
On This Page