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
|
/********************* */
/*! \file quantifiers_attributes.h
** \verbatim
** Top contributors (to current version):
** Morgan Deters, Paul Meng, Andrew Reynolds
** This file is part of the CVC4 project.
** Copyright (c) 2009-2017 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 Attributes for the theory quantifiers
**
** Attributes for the theory quantifiers.
**/
#include "cvc4_private.h"
#ifndef __CVC4__THEORY__QUANTIFIERS__QUANTIFIERS_ATTRIBUTES_H
#define __CVC4__THEORY__QUANTIFIERS__QUANTIFIERS_ATTRIBUTES_H
#include "expr/attribute.h"
#include "expr/node.h"
namespace CVC4 {
namespace theory {
class QuantifiersEngine;
/** Attribute true for quantifiers that are axioms */
struct AxiomAttributeId {};
typedef expr::Attribute< AxiomAttributeId, bool > AxiomAttribute;
/** Attribute true for quantifiers that are conjecture */
struct ConjectureAttributeId {};
typedef expr::Attribute< ConjectureAttributeId, bool > ConjectureAttribute;
/** Attribute true for function definition quantifiers */
struct FunDefAttributeId {};
typedef expr::Attribute< FunDefAttributeId, bool > FunDefAttribute;
/** Attribute true for quantifiers that we are doing quantifier elimination on */
struct QuantElimAttributeId {};
typedef expr::Attribute< QuantElimAttributeId, bool > QuantElimAttribute;
/** Attribute true for quantifiers that we are doing partial quantifier elimination on */
struct QuantElimPartialAttributeId {};
typedef expr::Attribute< QuantElimPartialAttributeId, bool > QuantElimPartialAttribute;
/** Attribute true for quantifiers that are SyGus conjectures */
struct SygusAttributeId {};
typedef expr::Attribute< SygusAttributeId, bool > SygusAttribute;
/**Attribute to give names to quantified formulas */
struct QuantNameAttributeId
{
};
typedef expr::Attribute<QuantNameAttributeId, bool> QuantNameAttribute;
/** Attribute true for quantifiers that are synthesis conjectures */
struct SynthesisAttributeId {};
typedef expr::Attribute< SynthesisAttributeId, bool > SynthesisAttribute;
struct InstLevelAttributeId
{
};
typedef expr::Attribute<InstLevelAttributeId, uint64_t> InstLevelAttribute;
/** Attribute for setting printing information for sygus variables
*
* For variable d of sygus datatype type, if
* d.getAttribute(SygusPrintProxyAttribute) = t, then printing d will print t.
*/
struct SygusPrintProxyAttributeId
{
};
typedef expr::Attribute<SygusPrintProxyAttributeId, Node>
SygusPrintProxyAttribute;
namespace quantifiers {
/** Attribute priority for rewrite rules */
//struct RrPriorityAttributeId {};
//typedef expr::Attribute< RrPriorityAttributeId, uint64_t > RrPriorityAttribute;
/** This struct stores attributes for a single quantified formula */
struct QAttributes
{
public:
QAttributes() : d_hasPattern(false), d_conjecture(false), d_axiom(false), d_sygus(false),
d_synthesis(false), d_rr_priority(-1), d_qinstLevel(-1), d_quant_elim(false), d_quant_elim_partial(false){}
~QAttributes(){}
/** does the quantified formula have a pattern? */
bool d_hasPattern;
/** if non-null, this is the rewrite rule representation of the quantified
* formula */
Node d_rr;
/** is this formula marked a conjecture? */
bool d_conjecture;
/** is this formula marked an axiom? */
bool d_axiom;
/** if non-null, this quantified formula is a function definition for function
* d_fundef_f */
Node d_fundef_f;
/** is this formula marked as a sygus conjecture? */
bool d_sygus;
/** is this formula marked as a synthesis (non-sygus) conjecture? */
bool d_synthesis;
/** if a rewrite rule, then this is the priority value for the rewrite rule */
int d_rr_priority;
/** stores the maximum instantiation level allowed for this quantified formula
* (-1 means allow any) */
int d_qinstLevel;
/** is this formula marked for quantifier elimination? */
bool d_quant_elim;
/** is this formula marked for partial quantifier elimination? */
bool d_quant_elim_partial;
/** the instantiation pattern list for this quantified formula (its 3rd child)
*/
Node d_ipl;
/** the name of this quantified formula */
Node d_name;
/** the quantifier id associated with this formula */
Node d_qid_num;
/** is this quantified formula a rewrite rule? */
bool isRewriteRule() const { return !d_rr.isNull(); }
/** is this quantified formula a function definition? */
bool isFunDef() const { return !d_fundef_f.isNull(); }
/**
* Is this a standard quantifier? A standard quantifier is one that we can
* perform destructive updates (variable elimination, miniscoping, etc).
*
* A quantified formula is not standard if it is sygus, one for which
* we are performing quantifier elimination, is a function definition, or
* has a name.
*/
bool isStandard() const;
};
/** This class caches information about attributes of quantified formulas
*
* It also has static utility functions used for determining attributes and
* information about
* quantified formulas.
*/
class QuantAttributes
{
public:
QuantAttributes( QuantifiersEngine * qe );
~QuantAttributes(){}
/** set user attribute
* This function applies an attribute
* This can be called when we mark expressions with attributes, e.g. (! q
* :attribute attr [node_values, str_value...]),
* It can also be called internally in various ways (for SyGus, quantifier
* elimination, etc.)
*/
static void setUserAttribute(const std::string& attr,
Node q,
std::vector<Node>& node_values,
std::string str_value);
/** compute quantifier attributes */
static void computeQuantAttributes(Node q, QAttributes& qa);
/** compute the attributes for q */
void computeAttributes(Node q);
/** is quantifier treated as a rewrite rule? */
static bool checkRewriteRule( Node q );
/** get the rewrite rule associated with the quanfied formula */
static Node getRewriteRule( Node q );
/** is fun def */
static bool checkFunDef( Node q );
/** is fun def */
static bool checkFunDefAnnotation( Node ipl );
/** is sygus conjecture */
static bool checkSygusConjecture( Node q );
/** is sygus conjecture */
static bool checkSygusConjectureAnnotation( Node ipl );
/** get fun def body */
static Node getFunDefHead( Node q );
/** get fun def body */
static Node getFunDefBody( Node q );
/** is quant elim annotation */
static bool checkQuantElimAnnotation( Node ipl );
/** is conjecture */
bool isConjecture( Node q );
/** is axiom */
bool isAxiom( Node q );
/** is function definition */
bool isFunDef( Node q );
/** is sygus conjecture */
bool isSygus( Node q );
/** is synthesis conjecture */
bool isSynthesis( Node q );
/** get instantiation level */
int getQuantInstLevel( Node q );
/** get rewrite rule priority */
int getRewriteRulePriority( Node q );
/** is quant elim */
bool isQuantElim( Node q );
/** is quant elim partial */
bool isQuantElimPartial( Node q );
/** get quant id num */
int getQuantIdNum( Node q );
/** get quant id num */
Node getQuantIdNumNode( Node q );
/** set instantiation level attr */
static void setInstantiationLevelAttr(Node n, uint64_t level);
/** set instantiation level attr */
static void setInstantiationLevelAttr(Node n, Node qn, uint64_t level);
private:
/** pointer to quantifiers engine */
QuantifiersEngine * d_quantEngine;
/** cache of attributes */
std::map< Node, QAttributes > d_qattr;
/** function definitions */
std::map< Node, bool > d_fun_defs;
};
}
}
}
#endif
|
