Index of values


(&) [Satisfiability]
Combines two satisfiability datas, intuitive: * a model has been found iff a model has been found for any of the two datas

A
add [Purity]
Adds a literal, possibly within a given range, to a purity meaning that the returned purity considers this literal as occurring (thus its negation is not pure).
add [Literal.ClosureSet]
add [Lemmas]
Adding a block in the set of lemmas.
add [Indexes]
The sum of an index and a number.
add [Looping.LoopingMap]
add_constraint [Literal.ClosureSet]
always_different [Constraint]
always_greater [Constraint]
apply_rules [Block]
apply_rules_with_closure [Block]
Apply the given rules while checking if closure applied
atom_of [Literal]
Returns the pair (prop,idx) i.e.

B
bot [Schema]
bot [Formula]
bounds_conjunction [Constraint]
The conjunction of two constraints.
bounds_constraint [Constraint]
A constraint generated from the comparison of two iteration bounds of regular schemata.

C
closure_applies [Literal.ClosureSet]
compare [Variable]
Comparisons
compare [Proposition]
Comparisons
compare [Literal]
Comparisons
compute_lit [Literal]
Standard substitution of parameters
compute_schema [Schema]
compute_term [Indexes]
Computes the integer obtained from the substitution of the only variable of t (if any) by the input integer
conj [Schema]
conj [Formula]
constraint_atom [Constraint]
A constraint containing just the comparison of two indexes.
contains_iterations [Schema]
contains_iterations [Block]
cstr_of [Block]

D
dedup [Block]
disj [Schema]
disj [Formula]

E
empty [Purity]
The empty purity.
empty [Literal.ClosureSet]
empty [Lemmas]
The empty set.
empty [Looping.LoopingMap]
equal [Variable]
equal [Schema]
Comparison
equal [Proposition]
equal [Literal]
equal [Indexes]
equal [Constraint]
equal [Block]
equiv [Schema]
equiv [Formula]
expr_involving_param [Schema]

F
find [Looping.LoopingMap]

G
get_param [Schema]
get_shift [Indexes]
get_var [Indexes]

I
idx_of [Literal]
imply [Schema]
imply [Formula]
inverse [Indexes]
Others
is_empty [Block]
is_equality [Constraint]
is_false [Constraint]
is_neg [Literal]
is_pos [Literal]
is_pure [Purity]
From a constraint and an already computed purity, says if a literal is pure.
is_regular [Schema]
it_conj [Schema]
it_disj [Schema]

L
list_to_string [Schema]
lit [Formula]
loops_among [Lemmas]
Checking if a block occurs in the set.

M
max [Modified]
max [Indexes]
Computes the maximum of two terms w.r.t.
max_bound [Schema]
max_bound [Block]
merge [Purity]
Merges two purities.
min [Indexes]

N
neg [Schema]
neg [Literal]
A negative literal (i.e.
neg_lit [Schema]
normalize [Block]
normalize_index [Constraint]
Normalization of a term for better detection of closure

O
of_num [Indexes]
An index which is just a number.
of_schs_and_cstr [Block]
of_string [Variable]
of_string [Proposition]
Printing
of_var [Indexes]
An index which is just a variable.
opposite [Literal]

P
pos [Literal]
pos_lit [Schema]
print [Schema]
print [Formula]
print [Constraint]
print_cnf [Formula]
print_dimacs [Formula]
prop_of [Literal]
purify [Purity.Purable]
Takes an object of type purable and eliminates the pure literals inside according to pur and cstr.
purity [Block]
purity_add [Purity.Purable]
Updates a purity depending on an object of type purable

R
regstab [Regstab]

S
schs_of [Block]
singleton [Lemmas]
A set containg only one lemma.
substitute [Substitution.Substituable]
The substitution function.

T
to_cnf [Formula]
Computes the conjunctive normal form of a formula (naive calculus: no sharing)
to_dimacs [Formula]
to_string [Variable]
to_string [Schema]
to_string [Proposition]
to_string [Literal]
to_string [Indexes]
to_string [Formula]
to_string [Constraint]
to_string [Block]
to_tex [Indexes]
top [Schema]
top [Formula]
top [Constraint]
The constraint constantly true.
total_compare [Schema]
total_compare [Indexes]

U
unfold_and_once [Schema]
unfold_or_once [Schema]
Similar with disjunction.
unsatisfiable [Satisfiability]

X
xor [Schema]
xor [Formula]