SMT-RAT
24.02
Toolbox for Strategic and Parallel Satisfiability-Modulo-Theories Solving
NegationSimplifier.h
Go to the documentation of this file.
1
#pragma once
2
3
#include "
BaseSimplifier.h
"
4
#include "../ExpressionPool.h"
5
6
namespace
smtrat
{
7
namespace
expression {
8
namespace
simplifier {
9
10
struct
NegationSimplifier
:
public
BaseSimplifier
{
11
const
ExpressionContent
*
simplify
(
const
UnaryExpression
& expr)
const
{
12
if
(expr.
type
!=
NOT
)
return
nullptr
;
13
return
expr.
expression
.
getContent
().
negation
;
14
}
15
};
16
17
}
18
}
19
}
BaseSimplifier.h
smtrat::expression::Expression::getContent
const ExpressionContent & getContent() const
Definition:
Expression.h:37
smtrat::expression::NOT
@ NOT
Definition:
ExpressionTypes.h:26
smtrat
Class to create the formulas for axioms.
Definition:
handle_options.h:10
smtrat::expression::ExpressionContent
Definition:
ExpressionContent.h:96
smtrat::expression::ExpressionContent::negation
const ExpressionContent * negation
Definition:
ExpressionContent.h:110
smtrat::expression::UnaryExpression
Definition:
ExpressionContent.h:43
smtrat::expression::UnaryExpression::type
UnaryType type
Definition:
ExpressionContent.h:44
smtrat::expression::UnaryExpression::expression
Expression expression
Definition:
ExpressionContent.h:45
smtrat::expression::simplifier::BaseSimplifier
Definition:
BaseSimplifier.h:9
smtrat::expression::simplifier::NegationSimplifier
Definition:
NegationSimplifier.h:10
smtrat::expression::simplifier::NegationSimplifier::simplify
const ExpressionContent * simplify(const UnaryExpression &expr) const
Definition:
NegationSimplifier.h:11
smtrat-expressions
simplifier
NegationSimplifier.h
Generated by
1.9.1