module Literal:Literals.sig
..end
I.e. P_n, P_n+1, P_1, P_i, ~P_i, ~P_1, etc.
Author(s): Vincent Aravantinos
type
t
val neg : Proposition.t -> Indexes.t -> t
A positive literal (i.e. of the form P_e)
val pos : Proposition.t -> Indexes.t -> t
val atom_of : t -> Proposition.t * Indexes.t
(prop,idx)
i.e. forget the sign of the literalval prop_of : t -> Proposition.t
val idx_of : t -> Indexes.t
val is_pos : t -> bool
val is_neg : t -> bool
val to_string : t -> string
val compare : t -> t -> int
val equal : t -> t -> bool
val compute_lit : t -> int -> t
include Substitution.Substituable
module PropSubs:Substitution.Substituable
with type substituable = t and type term = Proposition.t and type variable = Proposition.t
module LoopingMap:Looping.LoopingMap
with type loopable = t
module ClosureSet:sig
..end
val opposite : t -> t