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
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
|
/********************* */
/*! \file theory_uf.h
** \verbatim
** Original author: mdeters
** Major contributors: dejan
** Minor contributors (to current version): none
** This file is part of the CVC4 prototype.
** Copyright (c) 2009, 2010, 2011 The Analysis of Computer Systems Group (ACSys)
** Courant Institute of Mathematical Sciences
** New York University
** See the file COPYING in the top-level source directory for licensing
** information.\endverbatim
**
** \brief This is the interface to TheoryUF implementations
**
** This is the interface to TheoryUF implementations. All
** implementations of TheoryUF should inherit from this class.
**/
#include "cvc4_private.h"
#ifndef __CVC4__THEORY__UF__THEORY_UF_H
#define __CVC4__THEORY__UF__THEORY_UF_H
#include "expr/node.h"
#include "expr/attribute.h"
#include "theory/theory.h"
#include "theory/uf/equality_engine.h"
#include "theory/uf/symmetry_breaker.h"
#include "context/cdo.h"
#include "context/cdhashset.h"
namespace CVC4 {
namespace theory {
namespace uf {
class UfTermDb;
class InstantiatorTheoryUf;
class StrongSolverTheoryUf;
class TheoryUF : public Theory {
friend class InstantiatorTheoryUf;
friend class StrongSolverTheoryUf;
public:
class NotifyClass : public eq::EqualityEngineNotify {
TheoryUF& d_uf;
public:
NotifyClass(TheoryUF& uf): d_uf(uf) {}
bool eqNotifyTriggerEquality(TNode equality, bool value) {
Debug("uf") << "NotifyClass::eqNotifyTriggerEquality(" << equality << ", " << (value ? "true" : "false" )<< ")" << std::endl;
if (value) {
return d_uf.propagate(equality);
} else {
// We use only literal triggers so taking not is safe
return d_uf.propagate(equality.notNode());
}
}
bool eqNotifyTriggerPredicate(TNode predicate, bool value) {
Debug("uf") << "NotifyClass::eqNotifyTriggerPredicate(" << predicate << ", " << (value ? "true" : "false") << ")" << std::endl;
if (value) {
return d_uf.propagate(predicate);
} else {
return d_uf.propagate(predicate.notNode());
}
}
bool eqNotifyTriggerTermEquality(TheoryId tag, TNode t1, TNode t2, bool value) {
Debug("uf") << "NotifyClass::eqNotifyTriggerTermMerge(" << tag << ", " << t1 << ", " << t2 << ")" << std::endl;
if (value) {
return d_uf.propagate(t1.eqNode(t2));
} else {
return d_uf.propagate(t1.eqNode(t2).notNode());
}
}
void eqNotifyConstantTermMerge(TNode t1, TNode t2) {
Debug("uf") << "NotifyClass::eqNotifyConstantTermMerge(" << t1 << ", " << t2 << ")" << std::endl;
d_uf.conflict(t1, t2);
}
void eqNotifyNewClass(TNode t) {
Debug("uf") << "NotifyClass::eqNotifyNewClass(" << t << std::endl;
d_uf.eqNotifyNewClass(t);
}
void eqNotifyPreMerge(TNode t1, TNode t2) {
Debug("uf") << "NotifyClass::eqNotifyPreMerge(" << t1 << ", " << t2 << std::endl;
d_uf.eqNotifyPreMerge(t1, t2);
}
void eqNotifyPostMerge(TNode t1, TNode t2) {
Debug("uf") << "NotifyClass::eqNotifyPostMerge(" << t1 << ", " << t2 << std::endl;
d_uf.eqNotifyPostMerge(t1, t2);
}
void eqNotifyDisequal(TNode t1, TNode t2, TNode reason) {
Debug("uf") << "NotifyClass::eqNotifyDisequal(" << t1 << ", " << t2 << ", " << reason << std::endl;
d_uf.eqNotifyDisequal(t1, t2, reason);
}
};/* class TheoryUF::NotifyClass */
/** A callback class for ppRewrite(). See registerPpRewrite(), below. */
class PpRewrite {
public:
virtual Node ppRewrite(TNode node) = 0;
virtual ~PpRewrite() {}
};/* class TheoryUF::PpRewrite */
private:
/** The notify class */
NotifyClass d_notify;
/** The associated theory strong solver (or NULL if none) */
StrongSolverTheoryUf* d_thss;
/** Equaltity engine */
eq::EqualityEngine d_equalityEngine;
/** Are we in conflict */
context::CDO<bool> d_conflict;
/** The conflict node */
Node d_conflictNode;
/**
* Should be called to propagate the literal. We use a node here
* since some of the propagated literals are not kept anywhere.
*/
bool propagate(TNode literal);
/**
* Explain why this literal is true by adding assumptions
*/
void explain(TNode literal, std::vector<TNode>& assumptions);
/** Literals to propagate */
context::CDList<Node> d_literalsToPropagate;
/** Index of the next literal to propagate */
context::CDO<unsigned> d_literalsToPropagateIndex;
/** All the function terms that the theory has seen */
context::CDList<TNode> d_functionsTerms;
/** Symmetry analyzer */
SymmetryBreaker d_symb;
/** Conflict when merging two constants */
void conflict(TNode a, TNode b);
/** called when a new equivalance class is created */
void eqNotifyNewClass(TNode t);
/** called when two equivalance classes will merge */
void eqNotifyPreMerge(TNode t1, TNode t2);
/** called when two equivalance classes have merged */
void eqNotifyPostMerge(TNode t1, TNode t2);
/** called when two equivalence classes are made disequal */
void eqNotifyDisequal(TNode t1, TNode t2, TNode reason);
/** a registry type for keeping Node-specific callbacks for ppRewrite() */
typedef std::hash_map<Node, PpRewrite*, NodeHashFunction> RegisterPpRewrites;
/** a collection of callbacks to issue while doing a ppRewrite() */
RegisterPpRewrites d_registeredPpRewrites;
public:
/** Constructs a new instance of TheoryUF w.r.t. the provided context.*/
TheoryUF(context::Context* c, context::UserContext* u, OutputChannel& out, Valuation valuation, const LogicInfo& logicInfo, QuantifiersEngine* qe);
~TheoryUF() {
// destruct all ppRewrite() callbacks
for(RegisterPpRewrites::iterator i = d_registeredPpRewrites.begin();
i != d_registeredPpRewrites.end();
++i) {
delete i->second;
}
}
void check(Effort);
void preRegisterTerm(TNode term);
Node explain(TNode n);
void collectModelInfo( TheoryModel* m );
void ppStaticLearn(TNode in, NodeBuilder<>& learned);
void presolve();
void addSharedTerm(TNode n);
void computeCareGraph();
void propagate(Effort effort);
EqualityStatus getEqualityStatus(TNode a, TNode b);
std::string identify() const {
return "THEORY_UF";
}
eq::EqualityEngine* getEqualityEngine() {
return &d_equalityEngine;
}
StrongSolverTheoryUf* getStrongSolver() {
return d_thss;
}
Node ppRewrite(TNode node);
/**
* Register a ppRewrite() callback on "op." TheoryUF owns
* the callback, and will delete it when it is destructed.
*/
void registerPpRewrite(TNode op, PpRewrite* callback) {
d_registeredPpRewrites.insert(std::make_pair(op, callback));
}
};/* class TheoryUF */
}/* CVC4::theory::uf namespace */
}/* CVC4::theory namespace */
}/* CVC4 namespace */
#endif /* __CVC4__THEORY__UF__THEORY_UF_H */
|
