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
|
/********************* */
/*! \file pseudoboolean_proc.h
** \verbatim
** Top contributors (to current version):
** Tim King
** 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 [[ Add one-line brief description here ]]
**
** [[ Add lengthier description here ]]
** \todo document this file
**/
#include "cvc4_private.h"
#pragma once
#include <ext/hash_set>
#include <vector>
#include "context/cdhashmap.h"
#include "context/cdo.h"
#include "context/context.h"
#include "expr/node.h"
#include "theory/substitutions.h"
#include "util/maybe.h"
#include "util/rational.h"
namespace CVC4 {
namespace theory {
namespace arith {
class PseudoBooleanProcessor {
private:
// x -> <geqZero, leqOne>
typedef std::pair<Node, Node> PairNode;
typedef std::vector<Node> NodeVec;
typedef context::CDHashMap<Node, PairNode, NodeHashFunction> CDNode2PairMap;
CDNode2PairMap d_pbBounds;
SubstitutionMap d_subCache;
typedef __gnu_cxx::hash_set<Node, NodeHashFunction> NodeSet;
NodeSet d_learningCache;
context::CDO<unsigned> d_pbs;
// decompose into \sum pos >= neg + off
Maybe<Rational> d_off;
NodeVec d_pos;
NodeVec d_neg;
void clear();
/** Returns true if successful. */
bool decomposeAssertion(Node assertion, bool negated);
public:
PseudoBooleanProcessor(context::Context* user_context);
/** Assumes that the assertions have been rewritten. */
void learn(const NodeVec& assertions);
/** Assumes that the assertions have been rewritten. */
void applyReplacements(NodeVec& assertions);
bool likelyToHelp() const;
bool isPseudoBoolean(Node v) const;
// Adds the fact the that integert typed variable v
// must be >= 0 to the context.
// This is explained by the explanation exp.
// exp cannot be null.
void addGeqZero(Node v, Node exp);
// Adds the fact the that integert typed variable v
// must be <= 1 to the context.
// This is explained by the explanation exp.
// exp cannot be null.
void addLeqOne(Node v, Node exp);
static inline bool isIntVar(Node v){
return v.isVar() && v.getType().isInteger();
}
private:
/** Assumes that the assertion has been rewritten. */
void learn(Node assertion);
/** Rewrites a node */
Node applyReplacements(Node assertion);
void learnInternal(Node assertion, bool negated, Node orig);
void learnRewrittenGeq(Node assertion, bool negated, Node orig);
void addSub(Node from, Node to);
void learnGeqSub(Node geq);
static Node mkGeqOne(Node v);
};
}/* CVC4::theory::arith namespace */
}/* CVC4::theory namespace */
}/* CVC4 namespace */
|
