blob: abb8c92198a86c4b3d842450fc3389cd214373fb (
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
|
/******************************************************************************
* Top contributors (to current version):
* Andrew Reynolds, Aina Niemetz
*
* This file is part of the cvc5 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.
* ****************************************************************************
*
* Implementation of quantifier relevance.
*/
#include "theory/quantifiers/quant_relevance.h"
using namespace std;
using namespace cvc5::kind;
using namespace cvc5::context;
namespace cvc5 {
namespace theory {
namespace quantifiers {
QuantRelevance::QuantRelevance(Env& env) : QuantifiersUtil(env) {}
void QuantRelevance::registerQuantifier(Node f)
{
// compute symbols in f
std::vector<Node> syms;
computeSymbols(f[1], syms);
d_syms[f].insert(d_syms[f].begin(), syms.begin(), syms.end());
}
/** compute symbols */
void QuantRelevance::computeSymbols(Node n, std::vector<Node>& syms)
{
if (n.getKind() == APPLY_UF)
{
Node op = n.getOperator();
if (std::find(syms.begin(), syms.end(), op) == syms.end())
{
syms.push_back(op);
}
}
if (n.getKind() != FORALL)
{
for (int i = 0; i < (int)n.getNumChildren(); i++)
{
computeSymbols(n[i], syms);
}
}
}
size_t QuantRelevance::getNumQuantifiersForSymbol(Node s) const
{
std::map<Node, std::vector<Node> >::const_iterator it = d_syms_quants.find(s);
if (it == d_syms_quants.end())
{
return 0;
}
return it->second.size();
}
} // namespace quantifiers
} // namespace theory
} // namespace cvc5
|
