public final class SolverUtils
extends java.lang.Object
Modifier and Type | Field and Description |
---|---|
static ru.ispras.fortress.expression.NodeValue |
FALSE
The "false" syntax node.
|
static ru.ispras.fortress.expression.NodeValue |
TRUE
The "true" syntax node.
|
Modifier and Type | Method and Description |
---|---|
static boolean |
areCompatible(ru.ispras.fortress.expression.Node... expressions)
Checks whether the specified logical expressions are compatible
(getConjunction(nodes[0], ..., nodes[n-1]) is SAT) . |
static boolean |
areComplete(ru.ispras.fortress.expression.Node... expressions)
Checks whether the specified logical expressions are complete
{@code (!
|
static boolean |
isSat(ru.ispras.fortress.expression.Node node)
Checks whether the specified expression is satisfiable.
|
static ru.ispras.fortress.solver.SolverResult |
solve(ru.ispras.fortress.expression.Node node)
Solves the specified expression.
|
public static final ru.ispras.fortress.expression.NodeValue TRUE
public static final ru.ispras.fortress.expression.NodeValue FALSE
public static boolean isSat(ru.ispras.fortress.expression.Node node)
node
- Expression to be checked.true
if the expression is satisfiable or false
otherwise.public static boolean areCompatible(ru.ispras.fortress.expression.Node... expressions)
(getConjunction(nodes[0], ..., nodes[n-1]) is SAT)
.expressions
- Logical expressions to be checked.true
if the specified expressions are compatible, false
otherwise.public static boolean areComplete(ru.ispras.fortress.expression.Node... expressions)
(!getComplement(nodes[0], ..., nodes[n-1]) is SAT)
.expressions
- Logical expressions to be checked.true
if the specified expressions are complete, false
otherwise.public static ru.ispras.fortress.solver.SolverResult solve(ru.ispras.fortress.expression.Node node)
node
- Expression to be solved.