blob: 66004871b0ba3eeef82032f7d9c882e25807928e (
plain)
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
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
|
/********************* */
/*! \file callbacks.h
** \verbatim
** Top contributors (to current version):
** Tim King, Mathias Preiner, Clark Barrett
** This file is part of the CVC4 project.
** Copyright (c) 2009-2021 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 [[ Add one-line brief description here ]]
**
** [[ Add lengthier description here ]]
** \todo document this file
**/
#pragma once
#include "expr/node.h"
#include "theory/arith/arithvar.h"
#include "theory/arith/bound_counts.h"
#include "theory/arith/constraint_forward.h"
#include "theory/inference_id.h"
#include "util/rational.h"
namespace CVC5 {
class ProofNode;
namespace theory {
namespace arith {
class TheoryArithPrivate;
/**
* ArithVarCallBack provides a mechanism for agreeing on callbacks while
* breaking mutual recursion inclusion order problems.
*/
class ArithVarCallBack {
public:
virtual ~ArithVarCallBack() {}
virtual void operator()(ArithVar x) = 0;
};
/**
* Requests arithmetic variables for internal use,
* and releases arithmetic variables that are no longer being used.
*/
class ArithVarMalloc {
public:
virtual ~ArithVarMalloc() {}
virtual ArithVar request() = 0;
virtual void release(ArithVar v) = 0;
};
class TNodeCallBack {
public:
virtual ~TNodeCallBack() {}
virtual void operator()(TNode n) = 0;
};
class NodeCallBack {
public:
virtual ~NodeCallBack() {}
virtual void operator()(Node n) = 0;
};
class RationalCallBack {
public:
virtual ~RationalCallBack() {}
virtual Rational operator()() const = 0;
};
class SetupLiteralCallBack : public TNodeCallBack {
private:
TheoryArithPrivate& d_arith;
public:
SetupLiteralCallBack(TheoryArithPrivate& ta);
void operator()(TNode lit) override;
};
class DeltaComputeCallback : public RationalCallBack {
private:
const TheoryArithPrivate& d_ta;
public:
DeltaComputeCallback(const TheoryArithPrivate& ta);
Rational operator()() const override;
};
class BasicVarModelUpdateCallBack : public ArithVarCallBack{
private:
TheoryArithPrivate& d_ta;
public:
BasicVarModelUpdateCallBack(TheoryArithPrivate& ta);
void operator()(ArithVar x) override;
};
class TempVarMalloc : public ArithVarMalloc {
private:
TheoryArithPrivate& d_ta;
public:
TempVarMalloc(TheoryArithPrivate& ta);
ArithVar request() override;
void release(ArithVar v) override;
};
class RaiseConflict {
private:
TheoryArithPrivate& d_ta;
public:
RaiseConflict(TheoryArithPrivate& ta);
/** Calls d_ta.raiseConflict(c) */
void raiseConflict(ConstraintCP c, InferenceId id) const;
};
class FarkasConflictBuilder {
private:
RationalVector d_farkas;
ConstraintCPVec d_constraints;
ConstraintCP d_consequent;
bool d_consequentSet;
public:
/**
* Constructs a new FarkasConflictBuilder.
*/
FarkasConflictBuilder();
/**
* Adds an antecedent constraint to the conflict under construction
* with the farkas coefficient fc * mult.
*
* The value mult is either 1 or -1.
*/
void addConstraint(ConstraintCP c, const Rational& fc, const Rational& mult);
/**
* Adds an antecedent constraint to the conflict under construction
* with the farkas coefficient fc.
*/
void addConstraint(ConstraintCP c, const Rational& fc);
/**
* Makes the last constraint added the consequent.
* Can be done exactly once per reset().
*/
void makeLastConsequent();
/**
* Turns the antecendents into a proof of the negation of one of the
* antecedents.
*
* The buffer is no longer underConstruction afterwards.
*
* precondition:
* - At least two constraints have been asserted.
* - makeLastConsequent() has been called.
*
* postcondition: The returned constraint is in conflict.
*/
ConstraintCP commitConflict();
/** Returns true if a conflict has been pushed back since the last reset. */
bool underConstruction() const;
/** Returns true if the consequent has been set since the last reset. */
bool consequentIsSet() const;
/** Resets the state of the buffer. */
void reset();
};
class RaiseEqualityEngineConflict {
private:
TheoryArithPrivate& d_ta;
public:
RaiseEqualityEngineConflict(TheoryArithPrivate& ta);
/* If you are not an equality engine, don't use this!
*
* The proof should prove that `n` is a conflict.
* */
void raiseEEConflict(Node n, std::shared_ptr<ProofNode> pf) const;
};
class BoundCountingLookup {
private:
TheoryArithPrivate& d_ta;
public:
BoundCountingLookup(TheoryArithPrivate& ta);
const BoundsInfo& boundsInfo(ArithVar basic) const;
BoundCounts atBounds(ArithVar basic) const;
BoundCounts hasBounds(ArithVar basic) const;
};
} // namespace arith
} // namespace theory
} // namespace CVC5
|
