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
|
/********************* */
/*! \file quant_util.cpp
** \verbatim
** Original author: ajreynol
** Major contributors: bobot, mdeters
** Minor contributors (to current version): none
** This file is part of the CVC4 prototype.
** Copyright (c) 2009-2012 New York University and The University of Iowa
** See the file COPYING in the top-level source directory for licensing
** information.\endverbatim
**
** \brief Implementation of quantifier utilities
**/
#include "theory/quantifiers/quant_util.h"
#include "theory/quantifiers/inst_match.h"
#include "theory/quantifiers/term_database.h"
using namespace std;
using namespace CVC4;
using namespace CVC4::kind;
using namespace CVC4::context;
using namespace CVC4::theory;
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() );
//set initial relevance
int minRelevance = -1;
for( int i=0; i<(int)syms.size(); i++ ){
d_syms_quants[ syms[i] ].push_back( f );
int r = getRelevance( syms[i] );
if( r!=-1 && ( minRelevance==-1 || r<minRelevance ) ){
minRelevance = r;
}
}
if( minRelevance!=-1 ){
setRelevance( f, minRelevance+1 );
}
}
/** 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 );
}
}
}
/** set relevance */
void QuantRelevance::setRelevance( Node s, int r ){
if( d_computeRel ){
int rOld = getRelevance( s );
if( rOld==-1 || r<rOld ){
d_relevance[s] = r;
if( s.getKind()==FORALL ){
for( int i=0; i<(int)d_syms[s].size(); i++ ){
setRelevance( d_syms[s][i], r );
}
}else{
for( int i=0; i<(int)d_syms_quants[s].size(); i++ ){
setRelevance( d_syms_quants[s][i], r+1 );
}
}
}
}
}
QuantPhaseReq::QuantPhaseReq( Node n, bool computeEq ){
std::map< Node, int > phaseReqs2;
computePhaseReqs( n, false, phaseReqs2 );
for( std::map< Node, int >::iterator it = phaseReqs2.begin(); it != phaseReqs2.end(); ++it ){
if( it->second==1 ){
d_phase_reqs[ it->first ] = true;
}else if( it->second==-1 ){
d_phase_reqs[ it->first ] = false;
}
}
Debug("inst-engine-phase-req") << "Phase requirements for " << n << ":" << std::endl;
//now, compute if any patterns are equality required
if( computeEq ){
for( std::map< Node, bool >::iterator it = d_phase_reqs.begin(); it != d_phase_reqs.end(); ++it ){
Debug("inst-engine-phase-req") << " " << it->first << " -> " << it->second << std::endl;
if( it->first.getKind()==EQUAL ){
if( it->first[0].hasAttribute(InstConstantAttribute()) ){
if( !it->first[1].hasAttribute(InstConstantAttribute()) ){
d_phase_reqs_equality_term[ it->first[0] ] = it->first[1];
d_phase_reqs_equality[ it->first[0] ] = it->second;
Debug("inst-engine-phase-req") << " " << it->first[0] << ( it->second ? " == " : " != " ) << it->first[1] << std::endl;
}
}else if( it->first[1].hasAttribute(InstConstantAttribute()) ){
d_phase_reqs_equality_term[ it->first[1] ] = it->first[0];
d_phase_reqs_equality[ it->first[1] ] = it->second;
Debug("inst-engine-phase-req") << " " << it->first[1] << ( it->second ? " == " : " != " ) << it->first[0] << std::endl;
}
}
}
}
}
void QuantPhaseReq::computePhaseReqs( Node n, bool polarity, std::map< Node, int >& phaseReqs ){
bool newReqPol = false;
bool newPolarity;
if( n.getKind()==NOT ){
newReqPol = true;
newPolarity = !polarity;
}else if( n.getKind()==OR || n.getKind()==IMPLIES ){
if( !polarity ){
newReqPol = true;
newPolarity = false;
}
}else if( n.getKind()==AND ){
if( polarity ){
newReqPol = true;
newPolarity = true;
}
}else{
int val = polarity ? 1 : -1;
if( phaseReqs.find( n )==phaseReqs.end() ){
phaseReqs[n] = val;
}else if( val!=phaseReqs[n] ){
phaseReqs[n] = 0;
}
}
if( newReqPol ){
for( int i=0; i<(int)n.getNumChildren(); i++ ){
if( n.getKind()==IMPLIES && i==0 ){
computePhaseReqs( n[i], !newPolarity, phaseReqs );
}else{
computePhaseReqs( n[i], newPolarity, phaseReqs );
}
}
}
}
|
