package libzipperposition
sectionYPositions = computeSectionYPositions($el), 10)"
x-init="setTimeout(() => sectionYPositions = computeSectionYPositions($el), 10)"
>
On This Page
Library for Zipperposition
Install
dune-project
Dependency
Authors
Maintainers
Sources
2.0.tar.gz
md5=7a8e57388083ed763d12d18324c8a086
sha512=5c5ac312ada6b42907d1e91e349454a8375f7bf8165d3459721a40b707a840a3d6b3dc968a66f1040cb4de7aedf5c1c13f3e90b51337eae5ea6de41651d7bd63
doc/libzipperposition.calculi/Libzipperposition_calculi/Heuristics/Make/PS/CQueue/index.html
Module PS.CQueue
Priority queues on clauses
val register_conjecture_clause : C.t -> unitmodule WeightFun : sig ... endmodule PriorityFun : sig ... endval length : t -> intNumber of elements
val is_empty : t -> boolcheck whether the queue is empty
val name : t -> stringName of the implementation/role of the queue
Available Queues
val bfs : unit -> tFIFO
val almost_bfs : unit -> tHalf FIFO, half default
val explore : unit -> tUse heuristics for selecting "small" clauses
val ground : unit -> tFavor positive unit clauses and ground clauses
val goal_oriented : unit -> tcustom weight function that favors clauses that are "close" to initial conjectures. It is fair.
val default : unit -> tObtain the default queue
val of_profile : Libzipperposition.ClauseQueue_intf.profile -> tSelect the queue corresponding to the given profile
ignore the clause in the queue, and make sure it is never returned with the call to take_first(); returns true if clause was actually removed
IO
val pp : t CCFormat.printerval to_string : t -> string sectionYPositions = computeSectionYPositions($el), 10)"
x-init="setTimeout(() => sectionYPositions = computeSectionYPositions($el), 10)"
>
On This Page