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
|
/******************************************************************************
* Top contributors (to current version):
* Andrew Reynolds
*
* This file is part of the cvc5 project.
*
* Copyright (c) 2009-2021 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.
* ****************************************************************************
*
* Arithmetic utility for polynomial normalization
*/
#include "cvc5_private.h"
#ifndef CVC5__THEORY__ARITH__POLY_NORM_H
#define CVC5__THEORY__ARITH__POLY_NORM_H
#include <unordered_map>
#include "expr/node.h"
#include "util/rational.h"
namespace cvc5 {
namespace theory {
namespace arith {
/**
* A utility class for polynomial normalization. This is used by the proof
* rule PfRule::ARITH_POLY_NORM.
*/
class PolyNorm
{
public:
/**
* Add the monomial x*c to this polynomial.
* If x is null, then x*c is treated as c.
*/
void addMonomial(TNode x, const Rational& c, bool isNeg = false);
/**
* Multiply this polynomial by the monomial x*c, where c is a CONST_RATIONAL.
* If x is null, then x*c is treated as c.
*/
void multiplyMonomial(TNode x, const Rational& c);
/** Add polynomial p to this one. */
void add(const PolyNorm& p);
/** Subtract polynomial p from this one. */
void subtract(const PolyNorm& p);
/** Multiply this polynomial by p */
void multiply(const PolyNorm& p);
/** Clear this polynomial */
void clear();
/** Return true if this polynomial is empty */
bool empty() const;
/** Is this polynomial equal to polynomial p? */
bool isEqual(const PolyNorm& p) const;
/**
* Make polynomial from real term n. This method normalizes applications
* of operators PLUS, MINUS, UMINUS, MULT, and NONLINEAR_MULT only.
*/
static PolyNorm mkPolyNorm(TNode n);
/** Do a and b normalize to the same polynomial? */
static bool isArithPolyNorm(TNode a, TNode b);
private:
/**
* Given two terms that are variables in monomials, return the
* variable for the monomial when they are multiplied.
*/
static Node multMonoVar(TNode m1, TNode m2);
/** Get the list of variables whose product is m */
static std::vector<TNode> getMonoVars(TNode m);
/** The data, mapping monomial variables to coefficients */
std::unordered_map<Node, Rational> d_polyNorm;
};
} // namespace arith
} // namespace theory
} // namespace cvc5
#endif /* CVC5__THEORY__ARITH__POLY_NORM_H */
|
