1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
|
/********************* */
/*! \file theory_arith.h
** \verbatim
** Top contributors (to current version):
** Tim King, Alex Ozdemir, Morgan Deters
** This file is part of the CVC4 project.
** Copyright (c) 2009-2020 by the authors listed in the file AUTHORS
** in the top-level source directory) and their institutional affiliations.
** All rights reserved. See the file COPYING in the top-level source
** directory for licensing information.\endverbatim
**
** \brief Arithmetic theory.
** Arithmetic theory.
**/
#include "cvc4_private.h"
#pragma once
#include "expr/node.h"
#include "proof/arith_proof_recorder.h"
#include "theory/arith/arith_state.h"
#include "theory/arith/theory_arith_private_forward.h"
#include "theory/theory.h"
namespace CVC4 {
namespace theory {
namespace arith {
/**
* Implementation of QF_LRA.
* Based upon:
* http://research.microsoft.com/en-us/um/people/leonardo/cav06.pdf
*/
class TheoryArith : public Theory {
private:
friend class TheoryArithPrivate;
TheoryArithPrivate* d_internal;
TimerStat d_ppRewriteTimer;
/**
* @brief Where to store Farkas proofs of lemmas
*/
proof::ArithProofRecorder * d_proofRecorder;
public:
TheoryArith(context::Context* c,
context::UserContext* u,
OutputChannel& out,
Valuation valuation,
const LogicInfo& logicInfo,
ProofNodeManager* pnm = nullptr);
virtual ~TheoryArith();
//--------------------------------- initialization
/** get the official theory rewriter of this theory */
TheoryRewriter* getTheoryRewriter() override;
/**
* Returns true if this theory needs an equality engine, which is assigned
* to it (d_equalityEngine) by the equality engine manager during
* TheoryEngine::finishInit, prior to calling finishInit for this theory.
* If this method returns true, it stores instructions for the notifications
* this Theory wishes to receive from its equality engine.
*/
bool needsEqualityEngine(EeSetupInfo& esi) override;
/** finish initialization */
void finishInit() override;
//--------------------------------- end initialization
/**
* Does non-context dependent setup for a node connected to a theory.
*/
void preRegisterTerm(TNode n) override;
TrustNode expandDefinition(Node node) override;
void check(Effort e) override;
bool needsCheckLastEffort() override;
void propagate(Effort e) override;
TrustNode explain(TNode n) override;
bool getCurrentSubstitution(int effort,
std::vector<Node>& vars,
std::vector<Node>& subs,
std::map<Node, std::vector<Node> >& exp) override;
bool isExtfReduced(int effort,
Node n,
Node on,
std::vector<Node>& exp) override;
bool collectModelInfo(TheoryModel* m) override;
void shutdown() override {}
void presolve() override;
void notifyRestart() override;
PPAssertStatus ppAssert(TNode in, SubstitutionMap& outSubstitutions) override;
TrustNode ppRewrite(TNode atom) override;
void ppStaticLearn(TNode in, NodeBuilder<>& learned) override;
std::string identify() const override { return std::string("TheoryArith"); }
EqualityStatus getEqualityStatus(TNode a, TNode b) override;
void notifySharedTerm(TNode n) override;
Node getModelValue(TNode var) override;
std::pair<bool, Node> entailmentCheck(TNode lit) override;
void setProofRecorder(proof::ArithProofRecorder* proofRecorder)
{
d_proofRecorder = proofRecorder;
}
private:
/** The state object wrapping TheoryArithPrivate */
ArithState d_astate;
};/* class TheoryArith */
}/* CVC4::theory::arith namespace */
}/* CVC4::theory namespace */
}/* CVC4 namespace */
|
