#include <dpllt.h>
Inheritance diagram for SAT::DPLLT:
Definition at line 20 of file dpllt.h.
| TheoryAPI* SAT::DPLLT::theoryAPI | ( | ) | [inline] |
Definition at line 114 of file dpllt.h.
References d_theoryAPI.
Referenced by SAT::DPLLTBasic::checkSat(), SAT::DPLLTBasic::continueCheck(), SATAssignmentHook(), SATDecisionHook(), SATDeductionHook(), and SATDLevelHook().
| Decider* SAT::DPLLT::decider | ( | ) | [inline] |
Definition at line 115 of file dpllt.h.
References d_decider.
Referenced by SATDecisionHook(), and setDecider().
| void SAT::DPLLT::setDecider | ( | Decider * | decider | ) | [inline] |
| virtual void SAT::DPLLT::push | ( | ) | [pure virtual] |
Set a checkpoint for backtracking.
This should effectively save the current state of the solver. Note that it should also result in a call to TheoryAPI::push.
Implemented in SAT::DPLLTBasic, and SAT::DPLLTMiniSat.
Referenced by CVC3::SearchSat::push().
| virtual void SAT::DPLLT::pop | ( | ) | [pure virtual] |
Restore checkpoint.
This should return the state to what it was immediately before the last call to push. In particular, if one or more calls to checkSat, continueCheck, or addAssertion have been made since the last push, these should be undone. Note also that in this case, a single call to DPLLT::pop may result in multiple calls to TheoryAPI::pop.
Implemented in SAT::DPLLTBasic, and SAT::DPLLTMiniSat.
Referenced by CVC3::SearchSat::pop().
| virtual void SAT::DPLLT::addAssertion | ( | const CNF_Formula & | cnf | ) | [pure virtual] |
Add new clauses to the SAT solver.
This is used to add clauses that form a "context" for the next call to checkSat
Implemented in SAT::DPLLTBasic, and SAT::DPLLTMiniSat.
Referenced by CVC3::SearchSat::newUserAssumption().
| virtual CVC3::QueryResult SAT::DPLLT::checkSat | ( | const CNF_Formula & | cnf | ) | [pure virtual] |
Check the satisfiability of a set of clauses in the current context.
If the result is SATISFIABLE, UNKNOWN, or ABORT, the DPLLT engine should remain in the state it is in until pop() is called. If the result is UNSATISFIABLE, the DPLLT engine should return to the state it was in when called. Note that it should be possible to call checkSat multiple times, even if the result is true (each additional call should use the context left by the previous call).
Implemented in SAT::DPLLTBasic, and SAT::DPLLTMiniSat.
Referenced by CVC3::SearchSat::check().
| virtual CVC3::QueryResult SAT::DPLLT::continueCheck | ( | const CNF_Formula & | cnf | ) | [pure virtual] |
Continue checking the last check with additional constraints.
Should only be called after a previous call to checkSat (or continueCheck) that returned SATISFIABLE. It should add the clauses in cnf to the existing clause database and search for a satisfying assignment. As with checkSat, if the result is not UNSATISFIABLE, the DPLLT engine should remain in the state containing the satisfiable assignment until pop() is called. Similarly, if the result is UNSATISFIABLE, the DPLLT engine should return to the state it was in when checkSat was last called.
Implemented in SAT::DPLLTBasic, and SAT::DPLLTMiniSat.
Referenced by CVC3::SearchSat::check().
Get value of variable: unassigned, false, or true.
Implemented in SAT::DPLLTBasic, and SAT::DPLLTMiniSat.
TheoryAPI* SAT::DPLLT::d_theoryAPI [protected] |
Definition at line 101 of file dpllt.h.
Referenced by SAT::DPLLTMiniSat::addAssertion(), SAT::DPLLTBasic::addAssertion(), SAT::DPLLTMiniSat::checkSat(), SAT::DPLLTBasic::checkSat(), SAT::DPLLTBasic::continueCheck(), SAT::DPLLTMiniSat::pop(), SAT::DPLLTBasic::pop(), SAT::DPLLTMiniSat::push(), SAT::DPLLTBasic::push(), SAT::DPLLTMiniSat::pushSolver(), SAT::DPLLTMiniSat::search(), and theoryAPI().
Decider* SAT::DPLLT::d_decider [protected] |
Definition at line 102 of file dpllt.h.
Referenced by decider(), SAT::DPLLTMiniSat::pushSolver(), and setDecider().
1.5.1