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
|
/********************* */
/*! \file poly_conversion.h
** \verbatim
** Top contributors (to current version):
** Gereon Kremer
** This file is part of the CVC4 project.
** Copyright (c) 2009-2020 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 Utilities for converting to and from LibPoly objects.
**
** Utilities for converting to and from LibPoly objects.
**/
#ifndef CVC4__THEORY__ARITH__NL__POLY_CONVERSION_H
#define CVC4__THEORY__ARITH__NL__POLY_CONVERSION_H
#include "util/real_algebraic_number.h"
#ifdef CVC4_POLY_IMP
#include <poly/polyxx.h>
#include <iostream>
#include "expr/node.h"
#include "util/real_algebraic_number.h"
namespace CVC4 {
namespace theory {
namespace arith {
namespace nl {
/** Bijective mapping between CVC4 variables and poly variables. */
struct VariableMapper
{
/** A mapping from CVC4 variables to poly variables. */
std::map<CVC4::Node, poly::Variable> mVarCVCpoly;
/** A mapping from poly variables to CVC4 variables. */
std::map<poly::Variable, CVC4::Node> mVarpolyCVC;
/** Retrieves the according poly variable. */
poly::Variable operator()(const CVC4::Node& n);
/** Retrieves the according CVC4 variable. */
CVC4::Node operator()(const poly::Variable& n);
};
/** Convert a poly univariate polynomial to a CVC4::Node. */
CVC4::Node as_cvc_upolynomial(const poly::UPolynomial& p,
const CVC4::Node& var);
/** Convert a CVC4::Node to a poly univariate polynomial. */
poly::UPolynomial as_poly_upolynomial(const CVC4::Node& n,
const CVC4::Node& var);
/**
* Constructs a polynomial from the given node.
*
* While a Node may contain rationals, a Polynomial does not.
* We therefore also store the denominator of the returned polynomial and
* use it to construct the integer polynomial recursively.
* Once the polynomial has been fully constructed, we can ignore the
* denominator (except for its sign, which is always positive, though).
*/
poly::Polynomial as_poly_polynomial(const CVC4::Node& n, VariableMapper& vm);
/**
* Constructs a constraints (a polynomial and a sign condition) from the given
* node.
*/
std::pair<poly::Polynomial, poly::SignCondition> as_poly_constraint(
Node n, VariableMapper& vm);
/**
* Transforms a real algebraic number to a node suitable for putting it into a
* model. The resulting node can be either a constant (suitable for
* addCheckModelSubstitution) or a witness term (suitable for
* addCheckModelWitness).
*/
Node ran_to_node(const RealAlgebraicNumber& ran, const Node& ran_variable);
Node ran_to_node(const poly::AlgebraicNumber& an, const Node& ran_variable);
/**
* Transforms a poly::Value to a node.
* The resulting node can be either a constant or a witness term.
*/
Node value_to_node(const poly::Value& v, const Node& ran_variable);
/**
* Constructs a lemma that excludes a given interval from the feasible values of
* a variable. Conceptually, the resulting lemma has the form
* (OR
* (<= var interval.lower)
* (<= interval.upper var)
* )
* This method honors the interval bound types (open or closed), but also deals
* with real algebraic endpoints. If allowNonlinearLemma is false, real
* algebraic endpoints are reflected by coarse (numeric) approximations and thus
* may lead to lemmas that are weaker than they could be. Also, lemma creation
* may fail altogether.
* If allowNonlinearLemma is true, it tries to construct better lemmas (based on
* the sign of the defining polynomial of the real algebraic number). These
* lemmas are nonlinear, though, and may thus be expensive to use in the
* subsequent solving process.
*/
Node excluding_interval_to_lemma(const Node& variable,
const poly::Interval& interval,
bool allowNonlinearLemma);
/**
* Transforms a node to a poly::AlgebraicNumber.
* Expects a node of the following form:
* (AND
* (= (polynomial in __z) 0)
* (< CONST __z)
* (< __z CONST)
* )
*/
poly::AlgebraicNumber node_to_poly_ran(const Node& n, const Node& ran_variable);
/** Transforms a node to a RealAlgebraicNumber by calling node_to_poly_ran. */
RealAlgebraicNumber node_to_ran(const Node& n, const Node& ran_variable);
/**
* Transforms a node to a poly::Value.
*/
poly::Value node_to_value(const Node& n, const Node& ran_variable);
/**
* Give a rough estimate of the bitsize of the representation of `v`.
* It can be used as a rough measure of the size of complexity of a value, for
* example to avoid divergence or disallow huge lemmas.
*/
std::size_t bitsize(const poly::Value& v);
} // namespace nl
} // namespace arith
} // namespace theory
} // namespace CVC4
#endif
#endif
|
