summaryrefslogtreecommitdiff
path: root/src/theory/arith/arith_prop_manager.cpp
blob: 7f38c74a748abab2e14b27ac1e2dee938fbc23e7 (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
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

#include "theory/arith/arith_prop_manager.h"

#include "theory/arith/arith_utilities.h"
#include "context/context.h"
#include "context/cdlist.h"
#include "context/cdmap.h"
#include "context/cdo.h"

using namespace CVC4;
using namespace CVC4::theory;
using namespace CVC4::theory::arith;
using namespace CVC4::kind;
using namespace std;


bool ArithPropManager::isAsserted(TNode n) const{
  Node satValue = d_valuation.getSatValue(n);
  if(satValue.isNull()){
    return false;
  }else{
    //Assert(satValue.getConst<bool>());
    return true;
  }
}


Node ArithPropManager::strictlyWeakerAssertedUpperBound(ArithVar v, const DeltaRational& b) const{
  Node bound = boundAsNode(true, v, b);

  Assert(b.getInfinitesimalPart() <= 0);
  bool largeEpsilon = (b.getInfinitesimalPart() < -1);

  Node weaker = bound;
  do {
    if(largeEpsilon){
      weaker = d_atomDatabase.getBestImpliedUpperBound(weaker);
      largeEpsilon = false;
    }else{
      weaker = d_atomDatabase.getWeakerImpliedUpperBound(weaker);
    }
  }while(!weaker.isNull() && !isAsserted(weaker));
  return weaker;
}

Node ArithPropManager::strictlyWeakerAssertedLowerBound(ArithVar v, const DeltaRational& b) const{
  Debug("ArithPropManager") << "strictlyWeakerAssertedLowerBound" << endl;
  Node bound = boundAsNode(false, v, b);

  Assert(b.getInfinitesimalPart() >= 0);
  bool largeEpsilon = (b.getInfinitesimalPart() > 1);

  Node weaker = bound;
  Debug("ArithPropManager") << bound << b << endl;
  do {
    if(largeEpsilon){
      weaker = d_atomDatabase.getBestImpliedLowerBound(weaker);
      largeEpsilon = false;
    }else{
      weaker = d_atomDatabase.getWeakerImpliedLowerBound(weaker);
    }
  }while(!weaker.isNull() && !isAsserted(weaker));
  Debug("ArithPropManager") << "res: " << weaker << endl;
  return weaker;
}

Node ArithPropManager::getBestImpliedLowerBound(ArithVar v, const DeltaRational& b) const{
  Node bound = boundAsNode(false, v, b);
  return d_atomDatabase.getBestImpliedLowerBound(bound);
}
Node ArithPropManager::getBestImpliedUpperBound(ArithVar v, const DeltaRational& b) const{
  Node bound = boundAsNode(true, v, b);
  return d_atomDatabase.getBestImpliedUpperBound(bound);
}

Node ArithPropManager::boundAsNode(bool upperbound, ArithVar var, const DeltaRational& b) const {
  Assert((!upperbound) || (b.getInfinitesimalPart() <= 0) );
  Assert(upperbound || (b.getInfinitesimalPart() >= 0) );

  Node varAsNode = d_arithvarNodeMap.asNode(var);
  Kind kind;
  bool negate;
  if(upperbound){
    negate = b.getInfinitesimalPart() < 0;
    kind = negate ? GEQ : LEQ;
  } else{
    negate = b.getInfinitesimalPart() > 0;
    kind = negate ? LEQ : GEQ;
  }

  Node righthand = mkRationalNode(b.getNoninfinitesimalPart());
  Node bAsNode = NodeBuilder<2>(kind) << varAsNode << righthand;

  if(negate){
    bAsNode = NodeBuilder<1>(NOT) << bAsNode;
  }

  return bAsNode;
}

bool ArithPropManager::propagateArithVar(bool upperbound, ArithVar var, const DeltaRational& b, TNode reason){
  bool success = false;

  ++d_statistics.d_propagateArithVarCalls;

  Node bAsNode = boundAsNode(upperbound, var ,b);

  Node bestImplied = upperbound ?
    d_atomDatabase.getBestImpliedUpperBound(bAsNode):
    d_atomDatabase.getBestImpliedLowerBound(bAsNode);

  Debug("ArithPropManager") << upperbound <<","<< var <<","<< b <<","<< reason << endl
                            << bestImplied << endl;

  if(!bestImplied.isNull()){
    bool asserted = isAsserted(bestImplied);

    if( !asserted && !isPropagated(bestImplied)){
      propagate(bestImplied, reason);
      ++d_statistics.d_addedPropagation;
      success = true;
    }else if(!asserted){
      ++d_statistics.d_alreadyPropagatedNode;
    }else if(!isPropagated(bestImplied)){
      ++d_statistics.d_alreadySetSatLiteral;
    }
  }
  return success;
}

ArithPropManager::Statistics::Statistics():
  d_propagateArithVarCalls("arith::prop-manager::propagateArithVarCalls",0),
  d_addedPropagation("arith::prop-manager::addedPropagation",0),
  d_alreadySetSatLiteral("arith::prop-manager::alreadySetSatLiteral",0),
  d_alreadyPropagatedNode("arith::prop-manager::alreadyPropagatedNode",0)
{
  StatisticsRegistry::registerStat(&d_propagateArithVarCalls);
  StatisticsRegistry::registerStat(&d_alreadySetSatLiteral);
  StatisticsRegistry::registerStat(&d_alreadyPropagatedNode);
  StatisticsRegistry::registerStat(&d_addedPropagation);
}

ArithPropManager::Statistics::~Statistics()
{
  StatisticsRegistry::unregisterStat(&d_propagateArithVarCalls);
  StatisticsRegistry::unregisterStat(&d_alreadySetSatLiteral);
  StatisticsRegistry::unregisterStat(&d_alreadyPropagatedNode);
  StatisticsRegistry::unregisterStat(&d_addedPropagation);
}
generated by cgit on debian on lair
contact matthew@masot.net with questions or feedback