Checks the problem for satisfiability
Checks the problem for satisfiability
a set of literals to assert during the check.
Succes(m)
Checks the problem for satisfiability
Checks the problem for satisfiability
Success(model)
Checks the problem for satisfiability.
Checks the problem for satisfiability.
set of literals to assert during the check.
true iff the problem is satisfiable under the given assumptions.
Checks the problem for satisfiability.
Checks the problem for satisfiability.
if true, the timeout counter will not reset between each call.
true iff the problem is satisfiable.
Checks the problem for satisfiability.
Checks the problem for satisfiability.
a set of literals to assert during the check.
if true, timeout counter will not be reset between call.
true iff the problem is satisfiable under the given assumptions.
Checks the problem for satisfiability.
Checks the problem for satisfiability.
true iff the problem is satisfiable.
Success(m)
Checks if the given literal is part of the prime implicant computed using the previous call to primeImplicant.
Checks if the given literal is part of the prime implicant computed using the previous call to primeImplicant.
Success(b)
Generates a prime implicant of the problem if some exists.
Generates a prime implicant of the problem if some exists.
Success(pi)