summaryrefslogtreecommitdiff
path: root/src/theory/arith/arith_static_learner.h
blob: 0ed9cbe85b18ef3c23b3fac3794fed5bd82e306a (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
/*********************                                                        */
/*! \file arith_static_learner.h
 ** \verbatim
 ** Original author: taking
 ** Major contributors: none
 ** Minor contributors (to current version): none
 ** This file is part of the CVC4 prototype.
 ** Copyright (c) 2009, 2010, 2011  The Analysis of Computer Systems Group (ACSys)
 ** Courant Institute of Mathematical Sciences
 ** New York University
 ** See the file COPYING in the top-level source directory for licensing
 ** information.\endverbatim
 **
 ** \brief [[ Add one-line brief description here ]]
 **
 ** [[ Add lengthier description here ]]
 ** \todo document this file
 **/

#include "cvc4_private.h"

#ifndef __CVC4__THEORY__ARITH__ARITH_STATIC_LEARNER_H
#define __CVC4__THEORY__ARITH__ARITH_STATIC_LEARNER_H


#include "util/stats.h"
#include "theory/arith/arith_utilities.h"
#include <set>
#include <list>

namespace CVC4 {
namespace theory {
namespace arith {

class ArithStaticLearner {
private:
  typedef __gnu_cxx::hash_set<TNode, TNodeHashFunction> TNodeSet;

  /* Maps a variable, x, to the set of defTrue nodes of the form
   *  (=> _ (= x c))
   * where c is a constant.
   */
  typedef __gnu_cxx::hash_map<Node, std::set<Node>, NodeHashFunction> VarToNodeSetMap;
  VarToNodeSetMap d_miplibTrick;
  std::list<TNode> d_miplibTrickKeys;

  /**
   * Map from a node to it's minimum and maximum.
   */
  typedef __gnu_cxx::hash_map<Node, DeltaRational, NodeHashFunction> NodeToMinMaxMap;
  NodeToMinMaxMap d_minMap;
  NodeToMinMaxMap d_maxMap;

public:
  ArithStaticLearner();
  void staticLearning(TNode n, NodeBuilder<>& learned);

  void addBound(TNode n);

  void clear();

private:
  void process(TNode n, NodeBuilder<>& learned, const TNodeSet& defTrue);

  void postProcess(NodeBuilder<>& learned);

  void iteMinMax(TNode n, NodeBuilder<>& learned);
  void iteConstant(TNode n, NodeBuilder<>& learned);

  void miplibTrick(TNode var, std::set<Rational>& values, NodeBuilder<>& learned);

  /** These fields are designed to be accessable to ArithStaticLearner methods. */
  class Statistics {
  public:
    IntStat d_iteMinMaxApplications;
    IntStat d_iteConstantApplications;

    IntStat d_miplibtrickApplications;
    AverageStat d_avgNumMiplibtrickValues;

    Statistics();
    ~Statistics();
  };

  Statistics d_statistics;

};/* class ArithStaticLearner */

}/* CVC4::theory::arith namespace */
}/* CVC4::theory namespace */
}/* CVC4 namespace */

#endif /* __CVC4__THEORY__ARITH__ARITH_STATIC_LEARNER_H */
generated by cgit on debian on lair
contact matthew@masot.net with questions or feedback