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
|
/********************* */
/*! \file trigger_database.cpp
** \verbatim
** Top contributors (to current version):
** Andrew Reynolds, Tim King
** 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 trigger database class
**/
#include "theory/quantifiers/ematching/trigger_database.h"
#include "theory/quantifiers/ematching/ho_trigger.h"
#include "theory/quantifiers/ematching/trigger.h"
#include "theory/quantifiers/term_util.h"
namespace CVC4 {
namespace theory {
namespace quantifiers {
namespace inst {
TriggerDatabase::TriggerDatabase(QuantifiersState& qs,
QuantifiersInferenceManager& qim,
QuantifiersRegistry& qr,
TermRegistry& tr)
: d_qs(qs), d_qim(qim), d_qreg(qr), d_treg(tr)
{
}
TriggerDatabase::~TriggerDatabase() {}
Trigger* TriggerDatabase::mkTrigger(Node q,
const std::vector<Node>& nodes,
bool keepAll,
int trOption,
size_t useNVars)
{
std::vector<Node> trNodes;
if (!keepAll)
{
size_t nvars = useNVars == 0 ? q[0].getNumChildren() : useNVars;
if (!mkTriggerTerms(q, nodes, nvars, trNodes))
{
return nullptr;
}
}
else
{
trNodes.insert(trNodes.begin(), nodes.begin(), nodes.end());
}
// check for duplicate?
if (trOption != TR_MAKE_NEW)
{
Trigger* t = d_trie.getTrigger(trNodes);
if (t)
{
if (trOption == TR_GET_OLD)
{
// just return old trigger
return t;
}
return nullptr;
}
}
// check if higher-order
Trace("trigger-debug") << "Collect higher-order variable triggers..."
<< std::endl;
std::map<Node, std::vector<Node> > hoApps;
HigherOrderTrigger::collectHoVarApplyTerms(q, trNodes, hoApps);
Trace("trigger-debug") << "...got " << hoApps.size()
<< " higher-order applications." << std::endl;
Trigger* t;
if (!hoApps.empty())
{
t = new HigherOrderTrigger(d_qs, d_qim, d_qreg, d_treg, q, trNodes, hoApps);
}
else
{
t = new Trigger(d_qs, d_qim, d_qreg, d_treg, q, trNodes);
}
d_trie.addTrigger(trNodes, t);
return t;
}
Trigger* TriggerDatabase::mkTrigger(
Node q, Node n, bool keepAll, int trOption, size_t useNVars)
{
std::vector<Node> nodes;
nodes.push_back(n);
return mkTrigger(q, nodes, keepAll, trOption, useNVars);
}
bool TriggerDatabase::mkTriggerTerms(Node q,
const std::vector<Node>& nodes,
size_t nvars,
std::vector<Node>& trNodes)
{
// only take nodes that contribute variables to the trigger when added
std::map<Node, bool> vars;
std::map<Node, std::vector<Node> > patterns;
size_t varCount = 0;
std::map<Node, std::vector<Node> > varContains;
for (const Node& pat : nodes)
{
TermUtil::computeInstConstContainsForQuant(q, pat, varContains[pat]);
}
for (const Node& t : nodes)
{
const std::vector<Node>& vct = varContains[t];
bool foundVar = false;
for (const Node& v : vct)
{
Assert(TermUtil::getInstConstAttr(v) == q);
if (vars.find(v) == vars.end())
{
varCount++;
vars[v] = true;
foundVar = true;
}
}
if (foundVar)
{
trNodes.push_back(t);
for (const Node& v : vct)
{
patterns[v].push_back(t);
}
}
if (varCount == nvars)
{
break;
}
}
if (varCount < nvars)
{
Trace("trigger-debug") << "Don't consider trigger since it does not "
"contain specified number of variables."
<< std::endl;
Trace("trigger-debug") << nodes << std::endl;
// do not generate multi-trigger if it does not contain all variables
return false;
}
// now, minimize the trigger
for (size_t i = 0, tsize = trNodes.size(); i < tsize; i++)
{
bool keepPattern = false;
Node n = trNodes[i];
const std::vector<Node>& vcn = varContains[n];
for (const Node& v : vcn)
{
if (patterns[v].size() == 1)
{
keepPattern = true;
break;
}
}
if (!keepPattern)
{
// remove from pattern vector
for (const Node& v : vcn)
{
std::vector<Node>& pv = patterns[v];
for (size_t k = 0, pvsize = pv.size(); k < pvsize; k++)
{
if (pv[k] == n)
{
pv.erase(pv.begin() + k, pv.begin() + k + 1);
break;
}
}
}
// remove from trigger nodes
trNodes.erase(trNodes.begin() + i, trNodes.begin() + i + 1);
i--;
}
}
return true;
}
} // namespace inst
} // namespace quantifiers
} // namespace theory
} // namespace CVC4
|
