SMT-RAT
24.02
Toolbox for Strategic and Parallel Satisfiability-Modulo-Theories Solving
|
#include <iostream>
#include <map>
#include <vector>
#include "../common.h"
#include "BaseProjection.h"
#include "ProjectionComparator.h"
Go to the source code of this file.
Namespaces | |
smtrat | |
Class to create the formulas for axioms. | |
smtrat::cad | |
smtrat::cad::full_ec | |
Typedefs | |
using | smtrat::cad::full_ec::Polynomial = std::optional< UPoly > |
Functions | |
template<typename S > | |
std::ostream & | smtrat::cad::operator<< (std::ostream &os, const Projection< Incrementality::FULL, Backtracking::HIDE, S > &p) |