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
|
/******************************************************************************
* Top contributors (to current version):
* Andrew Reynolds, Tianyi Liang, Morgan Deters
*
* 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.
* ****************************************************************************
*
* The eager solver.
*/
#include "cvc5_private.h"
#ifndef CVC5__THEORY__STRINGS__EAGER_SOLVER_H
#define CVC5__THEORY__STRINGS__EAGER_SOLVER_H
#include <map>
#include "expr/node.h"
#include "smt/env_obj.h"
#include "theory/strings/arith_entail.h"
#include "theory/strings/eqc_info.h"
#include "theory/strings/solver_state.h"
#include "theory/strings/term_registry.h"
namespace cvc5 {
namespace theory {
namespace strings {
/**
* Eager solver, which is responsible for tracking of eager information and
* reporting conflicts to the solver state.
*/
class EagerSolver : protected EnvObj
{
public:
EagerSolver(Env& env,
SolverState& state,
TermRegistry& treg,
ArithEntail& aent);
~EagerSolver();
/** called when a new equivalence class is created */
void eqNotifyNewClass(TNode t);
/** called when two equivalence classes merge */
void eqNotifyMerge(TNode t1, TNode t2);
/** notify fact, called when a fact is asserted to theory of strings */
void notifyFact(TNode atom, bool polarity, TNode fact, bool isInternal);
private:
/** add endpoints to eqc info
*
* This method is called when term t is the explanation for why equivalence
* class eqc may have a constant endpoint due to a concatentation term concat.
* For example, we may call this method on:
* t := (str.++ x y), concat := (str.++ x y), eqc
* for some eqc that is currently equal to t. Another example is:
* t := (str.in.re z (re.++ r s)), concat := (re.++ r s), eqc
* for some eqc that is currently equal to z.
*/
void addEndpointsToEqcInfo(Node t, Node concat, Node eqc);
/**
* Check for conflict when merging equivalence classes with the given info,
* return the node corresponding to the conflict if so.
*/
Node checkForMergeConflict(Node a, Node b, EqcInfo* ea, EqcInfo* eb);
/** add arithmetic bound */
Node addArithmeticBound(EqcInfo* ea, Node t, bool isLower);
/** get bound for length term */
Node getBoundForLength(Node len, bool isLower);
/** Reference to the solver state */
SolverState& d_state;
/** Reference to the term registry */
TermRegistry& d_treg;
/** Arithmetic entailment */
ArithEntail& d_aent;
};
} // namespace strings
} // namespace theory
} // namespace cvc5
#endif /* CVC5__THEORY__STRINGS__EAGER_SOLVER_H */
|
