Semantics: The space is divided into a number of intervals: (-oo,a)[a,a](a,b)[b,b](b,oo) A bit is set if the constraints refutes the corresponding interval.
More...
#include <Covering.h>
Semantics: The space is divided into a number of intervals: (-oo,a)[a,a](a,b)[b,b](b,oo) A bit is set if the constraints refutes the corresponding interval.
Definition at line 19 of file Covering.h.
◆ Covering()
smtrat::mcsat::arithmetic::Covering::Covering |
( |
std::size_t |
intervals | ) |
|
|
inline |
◆ add()
void smtrat::mcsat::arithmetic::Covering::add |
( |
const FormulaT & |
c, |
|
|
const carl::Bitset & |
b |
|
) |
| |
|
inline |
◆ buildConflictingCore()
void smtrat::mcsat::arithmetic::Covering::buildConflictingCore |
( |
std::vector< FormulaT > & |
core | ) |
const |
|
inline |
◆ conflicts()
bool smtrat::mcsat::arithmetic::Covering::conflicts |
( |
| ) |
const |
|
inline |
◆ satisfyingInterval()
std::size_t smtrat::mcsat::arithmetic::Covering::satisfyingInterval |
( |
| ) |
const |
|
inline |
◆ satisfyingSamples()
const auto& smtrat::mcsat::arithmetic::Covering::satisfyingSamples |
( |
| ) |
const |
|
inline |
◆ operator<<
std::ostream& operator<< |
( |
std::ostream & |
os, |
|
|
const Covering & |
ri |
|
) |
| |
|
friend |
◆ mData
std::map<FormulaT, carl::Bitset> smtrat::mcsat::arithmetic::Covering::mData |
|
private |
◆ mOkay
carl::Bitset smtrat::mcsat::arithmetic::Covering::mOkay |
|
private |
The documentation for this class was generated from the following file: