SMT-RAT
24.02
Toolbox for Strategic and Parallel Satisfiability-Modulo-Theories Solving
BooleanEncoding.h
Go to the documentation of this file.
1
#pragma once
2
3
#include "
Common.h
"
4
#include "
AbstractTheory.h
"
5
#include "
ParserState.h
"
6
7
namespace
smtrat
{
8
namespace
parser {
9
10
/**
11
* Implements the theory of bitvectors.
12
*/
13
struct
BooleanEncodingTheory
:
public
AbstractTheory
{
14
BooleanEncodingTheory
(
ParserState
*
state
);
15
};
16
17
}
18
}
AbstractTheory.h
ParserState.h
smtrat
Class to create the formulas for axioms.
Definition:
handle_options.h:10
smtrat::parser::AbstractTheory
Base class for all theories.
Definition:
AbstractTheory.h:36
smtrat::parser::AbstractTheory::state
ParserState * state
Definition:
AbstractTheory.h:37
smtrat::parser::BooleanEncodingTheory
Implements the theory of bitvectors.
Definition:
BooleanEncoding.h:13
smtrat::parser::BooleanEncodingTheory::BooleanEncodingTheory
BooleanEncodingTheory(ParserState *state)
Definition:
BooleanEncoding.cpp:59
smtrat::parser::ParserState
Definition:
ParserState.h:18
Common.h
cli
parser
theories
BooleanEncoding.h
Generated by
1.9.1