Class for removing irrelevant conjuncts from a conjunction (like equations that have been applied to all other formulas)
Class for representing (possibly quantified) conjunctions of arithmetic
literal (equations, inequalities), predicate literals and negated
Conjunction
s.
Class for representing (possibly quantified) conjunctions of arithmetic
literal (equations, inequalities), predicate literals and negated
Conjunction
s. quans
describes how the lowest
quans.size
variables are quantified in the conjunction
(quans(0)
) is responsible for VariableTerm(0)
and
is the innermost quantifier, etc).
A lazy version of conjunctions.
A lazy version of conjunctions. This class can be useful when recursively
constructing large formulae, since the number of invocations of methods of
the class Conjunction
is reduced.
Class for representing a conjunction of negated Conjunction
s.
Class for representing a conjunction of negated Conjunction
s.
Interface for plugins that can be added to the
ReduceWithConjunction
class.
Interface for plugins that can be added to the
ReduceWithConjunction
class.
Factory to construct new reducer plugins.
Reducer plugin that sequentially applies a list of plugins.
Naive version of a subsumption test
Reducer plugin that always just returns unchanged formulas.