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
|
/********************* */
/*! \file candidate_generator.h
** \verbatim
** Top contributors (to current version):
** Morgan Deters, Andrew Reynolds, Clark Barrett
** This file is part of the CVC4 project.
** Copyright (c) 2009-2016 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 Theory uf candidate generator
**/
#include "cvc4_private.h"
#ifndef __CVC4__THEORY__QUANTIFIERS__CANDIDATE_GENERATOR_H
#define __CVC4__THEORY__QUANTIFIERS__CANDIDATE_GENERATOR_H
#include "theory/theory.h"
#include "theory/uf/equality_engine.h"
namespace CVC4 {
namespace theory {
namespace quantifiers {
class TermArgTrie;
}
class QuantifiersEngine;
namespace inst {
/** base class for generating candidates for matching */
class CandidateGenerator {
protected:
QuantifiersEngine* d_qe;
public:
CandidateGenerator( QuantifiersEngine* qe ) : d_qe( qe ){}
virtual ~CandidateGenerator(){}
/** Get candidates functions. These set up a context to get all match candidates.
cg->reset( eqc );
do{
Node cand = cg->getNextCandidate();
//.......
}while( !cand.isNull() );
eqc is the equivalence class you are searching in
*/
virtual void reset( Node eqc ) = 0;
virtual Node getNextCandidate() = 0;
/** add candidate to list of nodes returned by this generator */
virtual void addCandidate( Node n ) {}
/** call this at the beginning of each instantiation round */
virtual void resetInstantiationRound() = 0;
public:
/** legal candidate */
bool isLegalCandidate( Node n );
};/* class CandidateGenerator */
/** candidate generator queue (for manual candidate generation) */
class CandidateGeneratorQueue : public CandidateGenerator {
private:
std::vector< Node > d_candidates;
int d_candidate_index;
public:
CandidateGeneratorQueue( QuantifiersEngine* qe ) : CandidateGenerator( qe ), d_candidate_index( 0 ){}
~CandidateGeneratorQueue() throw() {}
void addCandidate( Node n );
void resetInstantiationRound(){}
void reset( Node eqc );
Node getNextCandidate();
};/* class CandidateGeneratorQueue */
//the default generator
class CandidateGeneratorQE : public CandidateGenerator
{
friend class CandidateGeneratorQEDisequal;
private:
//operator you are looking for
Node d_op;
//the equality class iterator
unsigned d_op_arity;
std::vector< quantifiers::TermArgTrie* > d_tindex;
std::vector< std::map< TNode, quantifiers::TermArgTrie >::iterator > d_tindex_iter;
eq::EqClassIterator d_eqc_iter;
//std::vector< Node > d_eqc;
int d_term_iter;
int d_term_iter_limit;
bool d_using_term_db;
enum {
cand_term_db,
cand_term_ident,
cand_term_eqc,
cand_term_tindex,
cand_term_none,
};
short d_mode;
bool isLegalOpCandidate( Node n );
Node d_n;
std::map< Node, bool > d_exclude_eqc;
public:
CandidateGeneratorQE( QuantifiersEngine* qe, Node pat );
~CandidateGeneratorQE() throw() {}
void resetInstantiationRound();
void reset( Node eqc );
Node getNextCandidate();
void excludeEqc( Node r ) { d_exclude_eqc[r] = true; }
bool isExcludedEqc( Node r ) { return d_exclude_eqc.find( r )!=d_exclude_eqc.end(); }
};
class CandidateGeneratorQELitEq : public CandidateGenerator
{
private:
//the equality classes iterator
eq::EqClassesIterator d_eq;
//equality you are trying to match equalities for
Node d_match_pattern;
Node d_match_gterm;
bool d_do_mgt;
public:
CandidateGeneratorQELitEq( QuantifiersEngine* qe, Node mpat );
~CandidateGeneratorQELitEq() throw() {}
void resetInstantiationRound();
void reset( Node eqc );
Node getNextCandidate();
};
class CandidateGeneratorQELitDeq : public CandidateGenerator
{
private:
//the equality class iterator for false
eq::EqClassIterator d_eqc_false;
//equality you are trying to match disequalities for
Node d_match_pattern;
//type of disequality
TypeNode d_match_pattern_type;
public:
CandidateGeneratorQELitDeq( QuantifiersEngine* qe, Node mpat );
~CandidateGeneratorQELitDeq() throw() {}
void resetInstantiationRound();
void reset( Node eqc );
Node getNextCandidate();
};
class CandidateGeneratorQEAll : public CandidateGenerator
{
private:
//the equality classes iterator
eq::EqClassesIterator d_eq;
//equality you are trying to match equalities for
Node d_match_pattern;
TypeNode d_match_pattern_type;
// quantifier/index for the variable we are matching
Node d_f;
unsigned d_index;
//first time
bool d_firstTime;
public:
CandidateGeneratorQEAll( QuantifiersEngine* qe, Node mpat );
~CandidateGeneratorQEAll() throw() {}
void resetInstantiationRound();
void reset( Node eqc );
Node getNextCandidate();
};
}/* CVC4::theory::inst namespace */
}/* CVC4::theory namespace */
}/* CVC4 namespace */
#endif /* __CVC4__THEORY__QUANTIFIERS__CANDIDATE_GENERATOR_H */
|
