package libzipperposition

You can search for identifiers within the package.

in-package search v0.2.0

Library for Zipperposition

Install

Dune Dependency

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

Authors

Maintainers

S

simon.cruanes.2007@m4x.org

Sources

1.6.tar.gz

md5=97cdb2f90468e9e27c7bbe3b4fb160bb

sha512=fee73369f673a91dfa9e265fc69be08b32235e10a495f3af6477d404fcd01e3452a0d012b150f3d7f97c00af2f6045019ad039164bf698f70d771231cc4efe5d

doc/libzipperposition.calculi/Libzipperposition_calculi/Fool/Make/argument-1-E/ProofState/CQueue/index.html

Module `ProofState.CQueue`

Priority queues on clauses

module C : module type of struct include C end with type t = C.t

module WeightFun : sig ... end

module PriorityFun : sig ... end

type t

A priority queue.

val add : t -> C.t -> unit

Add a clause to the Queue

val add_seq : t -> C.t Iter.t -> unit

Add clauses to the queue

val length : t -> int

Number of elements

val is_empty : t -> bool

check whether the queue is empty

val take_first : t -> C.t

Take first element of the queue, or raise Not_found

val name : t -> string

Name of the implementation/role of the queue

Available Queues

val add_to_mixed_eval : ratio:int -> weight_fun:(C.t -> int * int) -> t

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

On This Page

Available Queues
IO