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
|
/********************* */
/*! \file nl_constraint.h
** \verbatim
** Top contributors (to current version):
** Andrew Reynolds, Tim King
** This file is part of the CVC4 project.
** Copyright (c) 2009-2019 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 non-linear constraints
**/
#ifndef CVC4__THEORY__ARITH__NL_CONSTRAINT_H
#define CVC4__THEORY__ARITH__NL_CONSTRAINT_H
#include <map>
#include <vector>
#include "expr/kind.h"
#include "expr/node.h"
#include "theory/arith/nl_monomial.h"
namespace CVC4 {
namespace theory {
namespace arith {
/** constraint information
*
* The struct ( d_rhs, d_coeff, d_type ) represents that a literal is of the
* form (d_coeff * x) <d_type> d_rhs.
*/
struct ConstraintInfo
{
public:
/** The term on the right hand side of the constraint */
Node d_rhs;
/** The coefficent */
Node d_coeff;
/** The type (relation) of the constraint */
Kind d_type;
}; /* struct ConstraintInfo */
/** A database for constraints */
class ConstraintDb
{
public:
ConstraintDb(MonomialDb& mdb);
~ConstraintDb() {}
/** register constraint
*
* This ensures that atom is in the domain of the constraints maintained by
* this database.
*/
void registerConstraint(Node atom);
/** get constraints
*
* Returns a map m such that whenever
* m[lit][x] = ( r, coeff, k ), then
* ( lit <=> (coeff * x) <k> r )
*/
const std::map<Node, std::map<Node, ConstraintInfo> >& getConstraints();
/** Returns true if m is of maximal degree in atom
*
* For example, for atom x^2 + x*y + y >=0, the monomials x^2 and x*y
* are of maximal degree (2).
*/
bool isMaximal(Node atom, Node m) const;
private:
/** Reference to a monomial database */
MonomialDb& d_mdb;
/** List of all constraints */
std::vector<Node> d_constraints;
/** Is maximal degree */
std::map<Node, std::map<Node, bool> > d_c_info_maxm;
/** Constraint information */
std::map<Node, std::map<Node, ConstraintInfo> > d_c_info;
};
} // namespace arith
} // namespace theory
} // namespace CVC4
#endif /* CVC4__THEORY__ARITH__NL_SOLVER_H */
|
