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
|
/********************* */
/*! \file sygus_interpol.cpp
** \verbatim
** Top contributors (to current version):
** Ying Sheng
** 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 Implementation of sygus interpolation utility, which
** transforms an input of axioms and conjecture into an interpolation problem,
*and solve it.
**/
#include "theory/quantifiers/sygus/sygus_interpol.h"
#include "expr/datatype.h"
#include "expr/dtype.h"
#include "expr/node_algorithm.h"
#include "expr/sygus_datatype.h"
#include "options/smt_options.h"
#include "theory/datatypes/sygus_datatype_utils.h"
#include "theory/quantifiers/quantifiers_attributes.h"
#include "theory/quantifiers/quantifiers_rewriter.h"
#include "theory/quantifiers/sygus/sygus_grammar_cons.h"
#include "theory/quantifiers/term_util.h"
#include "theory/rewriter.h"
namespace CVC4 {
namespace theory {
namespace quantifiers {
SygusInterpol::SygusInterpol() {}
SygusInterpol::SygusInterpol(LogicInfo logic) : d_logic(logic) {}
void SygusInterpol::collectSymbols(const std::vector<Node>& axioms,
const Node& conj)
{
Trace("sygus-interpol-debug") << "Collect symbols..." << std::endl;
std::unordered_set<Node, NodeHashFunction> symSetAxioms;
std::unordered_set<Node, NodeHashFunction> symSetConj;
for (size_t i = 0, size = axioms.size(); i < size; i++)
{
expr::getSymbols(axioms[i], symSetAxioms);
}
expr::getSymbols(conj, symSetConj);
d_syms.insert(d_syms.end(), symSetAxioms.begin(), symSetAxioms.end());
d_syms.insert(d_syms.end(), symSetConj.begin(), symSetConj.end());
for (const Node& elem : symSetConj)
{
if (symSetAxioms.find(elem) != symSetAxioms.end())
{
d_symSetShared.insert(elem);
}
}
Trace("sygus-interpol-debug")
<< "...finish, got " << d_syms.size() << " symbols in total. And "
<< d_symSetShared.size() << " shared symbols." << std::endl;
}
void SygusInterpol::createVariables(bool needsShared)
{
NodeManager* nm = NodeManager::currentNM();
for (const Node& s : d_syms)
{
TypeNode tn = s.getType();
if (tn.isConstructor() || tn.isSelector() || tn.isTester())
{
// datatype symbols should be considered interpreted symbols here, not
// (higher-order) variables.
continue;
}
// Notice that we allow for non-first class (e.g. function) variables here.
std::stringstream ss;
ss << s;
Node var = nm->mkBoundVar(tn);
d_vars.push_back(var);
Node vlv = nm->mkBoundVar(ss.str(), tn);
d_vlvs.push_back(vlv);
if (!needsShared || d_symSetShared.find(s) != d_symSetShared.end())
{
d_varsShared.push_back(var);
d_vlvsShared.push_back(vlv);
d_varTypesShared.push_back(tn);
}
}
// make the sygus variable list
d_ibvlShared = nm->mkNode(kind::BOUND_VAR_LIST, d_vlvsShared);
Trace("sygus-interpol-debug") << "...finish" << std::endl;
}
void SygusInterpol::getIncludeCons(
const std::vector<Node>& axioms,
const Node& conj,
std::map<TypeNode, std::unordered_set<Node, NodeHashFunction>>& result)
{
NodeManager* nm = NodeManager::currentNM();
Assert(options::produceInterpols() != options::ProduceInterpols::NONE);
// ASSUMPTIONS
if (options::produceInterpols() == options::ProduceInterpols::ASSUMPTIONS)
{
Node tmpAssumptions =
(axioms.size() == 1 ? axioms[0] : nm->mkNode(kind::AND, axioms));
expr::getOperatorsMap(tmpAssumptions, result);
}
// CONJECTURE
else if (options::produceInterpols() == options::ProduceInterpols::CONJECTURE)
{
expr::getOperatorsMap(conj, result);
}
// SHARED
else if (options::produceInterpols() == options::ProduceInterpols::SHARED)
{
// Get operators from axioms
std::map<TypeNode, std::unordered_set<Node, NodeHashFunction>>
include_cons_axioms;
Node tmpAssumptions =
(axioms.size() == 1 ? axioms[0] : nm->mkNode(kind::AND, axioms));
expr::getOperatorsMap(tmpAssumptions, include_cons_axioms);
// Get operators from conj
std::map<TypeNode, std::unordered_set<Node, NodeHashFunction>>
include_cons_conj;
expr::getOperatorsMap(conj, include_cons_conj);
// Compute intersection
for (std::map<TypeNode,
std::unordered_set<Node, NodeHashFunction>>::iterator it =
include_cons_axioms.begin();
it != include_cons_axioms.end();
it++)
{
TypeNode tn = it->first;
std::unordered_set<Node, NodeHashFunction> axiomsOps = it->second;
std::map<TypeNode, std::unordered_set<Node, NodeHashFunction>>::iterator
concIter = include_cons_conj.find(tn);
if (concIter != include_cons_conj.end())
{
std::unordered_set<Node, NodeHashFunction> conjOps = concIter->second;
for (const Node& n : axiomsOps)
{
if (conjOps.find(n) != conjOps.end())
{
if (result.find(tn) == result.end())
{
result[tn] = std::unordered_set<Node, NodeHashFunction>();
}
result[tn].insert(n);
}
}
}
}
}
// ALL
else if (options::produceInterpols() == options::ProduceInterpols::ALL)
{
Node tmpAssumptions =
(axioms.size() == 1 ? axioms[0] : nm->mkNode(kind::AND, axioms));
Node tmpAll = nm->mkNode(kind::AND, tmpAssumptions, conj);
expr::getOperatorsMap(tmpAll, result);
}
}
TypeNode SygusInterpol::setSynthGrammar(const TypeNode& itpGType,
const std::vector<Node>& axioms,
const Node& conj)
{
Trace("sygus-interpol-debug") << "Setup grammar..." << std::endl;
TypeNode itpGTypeS;
if (!itpGType.isNull())
{
// set user-defined grammar
Assert(itpGType.isDatatype() && itpGType.getDType().isSygus());
itpGTypeS = datatypes::utils::substituteAndGeneralizeSygusType(
itpGType, d_syms, d_vlvs);
Assert(itpGTypeS.isDatatype() && itpGTypeS.getDType().isSygus());
// TODO(Ying Sheng) check if the vars in user-defined grammar, are
// consistent with the shared vars
}
else
{
// set default grammar
std::map<TypeNode, std::unordered_set<Node, NodeHashFunction>> extra_cons;
std::map<TypeNode, std::unordered_set<Node, NodeHashFunction>> exclude_cons;
std::map<TypeNode, std::unordered_set<Node, NodeHashFunction>> include_cons;
getIncludeCons(axioms, conj, include_cons);
std::unordered_set<Node, NodeHashFunction> terms_irrelevant;
itpGTypeS =
CVC4::theory::quantifiers::CegGrammarConstructor::mkSygusDefaultType(
NodeManager::currentNM()->booleanType(),
d_ibvlShared,
"interpolation_grammar",
extra_cons,
exclude_cons,
include_cons,
terms_irrelevant);
}
Trace("sygus-interpol-debug") << "...finish setting up grammar" << std::endl;
return itpGTypeS;
}
Node SygusInterpol::mkPredicate(const std::string& name)
{
Node itp;
return itp;
}
void SygusInterpol::mkSygusConjecture(Node itp,
const std::vector<Node>& axioms,
const Node& conj)
{
}
bool SygusInterpol::findInterpol(Expr& interpol, Node itp)
{
return false;
}
bool SygusInterpol::SolveInterpolation(const std::string& name,
const std::vector<Node>& axioms,
const Node& conj,
const TypeNode& itpGType,
Expr& interpol)
{
return false;
}
} // namespace quantifiers
} // namespace theory
} // namespace CVC4
|
