#include <dpllt.h>
Inheritance diagram for SAT::DPLLT::TheoryAPI:
Definition at line 25 of file dpllt.h.
| virtual SAT::DPLLT::TheoryAPI::~TheoryAPI | ( | ) | [inline, virtual] |
| virtual void SAT::DPLLT::TheoryAPI::push | ( | ) | [pure virtual] |
Set a checkpoint for backtracking.
Implemented in CVC3::SearchSatTheoryAPI.
Referenced by MiniSat::Solver::search().
| virtual void SAT::DPLLT::TheoryAPI::pop | ( | ) | [pure virtual] |
Restore most recent checkpoint.
Implemented in CVC3::SearchSatTheoryAPI.
Referenced by MiniSat::Solver::backtrack(), and MiniSat::Solver::popTheories().
| virtual void SAT::DPLLT::TheoryAPI::assertLit | ( | Lit | l | ) | [pure virtual] |
Notify theory when a literal is set to true.
Implemented in CVC3::SearchSatTheoryAPI.
Referenced by MiniSat::Solver::propagate(), MiniSat::Solver::push(), and MiniSat::Solver::search().
| virtual ConsistentResult SAT::DPLLT::TheoryAPI::checkConsistent | ( | Clause & | c, | |
| bool | fullEffort | |||
| ) | [pure virtual] |
Check consistency of the current assignment.
The result is either INCONSISTENT, MAYBE_CONSISTENT, or CONSISTENT Most of the time, fullEffort should be false, and the result will most likely be either INCONSISTENT or MAYBE_CONSISTENT. To force a full check, set fullEffort to true. When fullEffort is set to true, the only way the result can be MAYBE_CONSISTENT is if there are new clauses to get (via getNewClauses).
| c | should be empty initially. If INCONSISTENT is returned, then c will contain a conflict clause when it returns. Otherwise, c is unchanged. | |
| fullEffort | true for a full check, false for a fast check |
Referenced by MiniSat::Solver::search().
| virtual bool SAT::DPLLT::TheoryAPI::outOfResources | ( | ) | [pure virtual] |
Check if the work budget has been exceeded.
If true, it means that the engine should quit and return ABORT. Otherwise, it should proceed normally. This should be checked regularly.
Implemented in CVC3::SearchSatTheoryAPI.
Referenced by MiniSat::Solver::search().
| virtual Lit SAT::DPLLT::TheoryAPI::getImplication | ( | ) | [pure virtual] |
Get a literal that is implied by the current assignment.
This is theory propagation. It can be called repeatedly and returns a Null literal when there are no more literals to propagate. It should only be called when the assignment is not known to be inconsistent.
Implemented in CVC3::SearchSatTheoryAPI.
Referenced by MiniSat::Solver::push(), and MiniSat::Solver::search().
Get an explanation for a literal that was implied.
Given a literal l that is true in the current assignment as a result of an earlier call to getImplication(), this method returns a clause which justifies the propagation of that literal. The clause will contain the literal l as well as other literals that are in the current assignment. The clause is such that it would have caused a unit propagation at the time getImplication() was called.
| l | the literal | |
| c | should be empty initially. |
Referenced by MiniSat::Solver::push(), MiniSat::Solver::resolveTheoryImplication(), and MiniSat::Solver::search().
| virtual bool SAT::DPLLT::TheoryAPI::getNewClauses | ( | CNF_Formula & | cnf | ) | [pure virtual] |
Get new clauses from the theory.
This is extended theory learning. Returns false if there are no new clauses to get. Otherwise, returns true and new clauses are added to cnf. Note that the new clauses (if any) are theory lemmas, i.e. clauses that are valid in the theory and not dependent on the current assignment. The clauses may contain new literals as well as literals that are true in the current assignment.
| cnf | should be empty initially. |
Implemented in CVC3::SearchSatTheoryAPI.
Referenced by MiniSat::Solver::push(), and MiniSat::Solver::search().
1.5.1