org.sosy_lab.solver.api

Interface BooleanFormulaManager

All Known Implementing Classes:

AbstractBooleanFormulaManager

public interface BooleanFormulaManager

Manager for dealing with boolean formulas.

Method Summary

Methods

Modifier and Type	Method and Description
BooleanFormula	and(BooleanFormula bits1, BooleanFormula bits2) Creates a formula representing an AND of the two arguments.
BooleanFormula	and(Collection<BooleanFormula> bits)
BooleanFormula	equivalence(BooleanFormula formula1, BooleanFormula formula2) Creates a formula representing an equivalence of the two arguments.
<T extends Formula> T	ifThenElse(BooleanFormula cond, T f1, T f2) Creates a formula representing IF cond THEN f1 ELSE f2
BooleanFormula	implication(BooleanFormula formula1, BooleanFormula formula2)
boolean	isFalse(BooleanFormula formula) Check, if the formula is the formula "FALSE".
boolean	isTrue(BooleanFormula formula) Check, if the formula is the formula "TRUE".
BooleanFormula	makeBoolean(boolean value) Returns a BooleanFormula representing the given value.
BooleanFormula	makeVariable(String pVar)
BooleanFormula	not(BooleanFormula bits) Creates a formula representing a negation of the argument.
BooleanFormula	or(BooleanFormula bits1, BooleanFormula bits2) Creates a formula representing an OR of the two arguments.
BooleanFormula	or(Collection<BooleanFormula> bits)
<R> R	visit(BooleanFormulaVisitor<R> visitor, BooleanFormula formula) Visit the formula with the given visitor.
void	visitRecursively(BooleanFormulaVisitor<TraversalProcess> rFormulaVisitor, BooleanFormula f) Visit the formula recursively with a given BooleanFormulaVisitor.
BooleanFormula	xor(BooleanFormula bits1, BooleanFormula bits2) Creates a formula representing XOR of the two arguments.

Method Detail

makeBoolean

BooleanFormula makeBoolean(boolean value)

Returns a BooleanFormula representing the given value.

Parameters:

value - the boolean value the returned Formula should represent

Returns:

a Formula representing the given value

makeVariable

BooleanFormula makeVariable(String pVar)

equivalence

BooleanFormula equivalence(BooleanFormula formula1,
                         BooleanFormula formula2)

Creates a formula representing an equivalence of the two arguments.

Parameters:

formula1 - a Formula

formula2 - a Formula

Returns:

formula1 <-> formula2

implication

BooleanFormula implication(BooleanFormula formula1,
                         BooleanFormula formula2)

Returns:

formula1 => formula2.

isTrue

boolean isTrue(BooleanFormula formula)

Check, if the formula is the formula "TRUE". This does not include a satisfiability check, but only a syntactical matching. However, depending on the SMT solver, there might be some pre-processing of formulas such that trivial cases like "1==1" are recognized and rewritten as "TRUE", and thus such formulas might also be matched.

isFalse

boolean isFalse(BooleanFormula formula)

Check, if the formula is the formula "FALSE". This does not include a satisfiability check, but only a syntactical matching. However, depending on the SMT solver, there might be some pre-processing of formulas such that trivial cases like "1==2" are recognized and rewritten as "FALSE", and thus such formulas might also be matched.

ifThenElse

<T extends Formula> T ifThenElse(BooleanFormula cond,
                               T f1,
                               T f2)

Creates a formula representing IF cond THEN f1 ELSE f2

Parameters:

cond - a Formula

f1 - a Formula

f2 - a Formula

Returns:

(IF cond THEN f1 ELSE f2)

not

BooleanFormula not(BooleanFormula bits)

Creates a formula representing a negation of the argument.

Parameters:

bits - a Formula

Returns:

!bits

and

BooleanFormula and(BooleanFormula bits1,
                 BooleanFormula bits2)

Creates a formula representing an AND of the two arguments.

Parameters:

bits1 - a Formula

bits2 - a Formula

Returns:

bits1 & bits2

and

BooleanFormula and(Collection<BooleanFormula> bits)

or

BooleanFormula or(BooleanFormula bits1,
                BooleanFormula bits2)

Creates a formula representing an OR of the two arguments.

Parameters:

bits1 - a Formula

bits2 - a Formula

Returns:

bits1 | bits2

or

BooleanFormula or(Collection<BooleanFormula> bits)

xor

BooleanFormula xor(BooleanFormula bits1,
                 BooleanFormula bits2)

Creates a formula representing XOR of the two arguments.

visit

<R> R visit(BooleanFormulaVisitor<R> visitor,
          BooleanFormula formula)

Visit the formula with the given visitor.

visitRecursively

void visitRecursively(BooleanFormulaVisitor<TraversalProcess> rFormulaVisitor,
                    BooleanFormula f)

Visit the formula recursively with a given BooleanFormulaVisitor.

This method guarantees that the traversal is done iteratively, without using Java recursion, and thus is not prone to StackOverflowErrors.

Furthermore, this method also guarantees that every equal part of the formula is visited only once. Thus it can be used to traverse DAG-like formulas efficiently.