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.2.17@m4x.org

Sources

2.1.tar.gz

md5=e72de75e9f0f87da9e6e8c0a4d4c89f9

sha512=81becfc9badd686ab3692cd9312172aa4c4e3581b110e81770bb01e0ffbc1eb8495d0dd6d43b98f3d06e6b8c8a338174c13ebafb4e9849a3ddf89f9a3a72c287

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

val register_conjecture_clause : C.t -> unit

val on_proof_state_init : C.t Iter.t Logtk.Signal.t

Weight functions

module WeightFun : sig ... end

module PriorityFun : sig ... end

type t

A priority queue.

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

Add a clause to the Queue; returns true if clause was actually added

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 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

val all_clauses : t -> C.t Iter.t

All clauses stored in the queue, in no particular order

val mem_cl : t -> C.t -> bool

is the clause present in the passive set?

val remove : t -> C.t -> bool

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.printer

val to_string : t -> string

On This Page

Available Queues
IO