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
|
/********************* */
/*! \file inst_strategy_enumerative.h
** \verbatim
** Top contributors (to current version):
** Andrew Reynolds, Mathias Preiner
** This file is part of the CVC4 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.\endverbatim
**
** \brief Enumerative instantiation
**/
#include "cvc4_private.h"
#ifndef CVC4__INST_STRATEGY_ENUMERATIVE_H
#define CVC4__INST_STRATEGY_ENUMERATIVE_H
#include "theory/quantifiers/quant_module.h"
namespace CVC5 {
namespace theory {
namespace quantifiers {
class RelevantDomain;
/** Enumerative instantiation
*
* This class implements enumerative instantiation described
* in Reynolds et al., "Revisiting Enumerative Instantiation".
*
* It is an instance of QuantifiersModule, whose main
* task is to make calls to QuantifiersEngine during
* calls to QuantifiersModule::check(...).
*
* This class adds instantiations based on enumerating
* well-typed terms that occur in the current context
* based on a heuristically determined ordering on
* tuples of terms. This ordering incorporates
* reasoning about the relevant domain of quantified
* formulas (see theory/quantifiers/relevant_domain.h).
* We consider only ground terms that occur in the
* context due to Theorem 1 of "Revisiting Enumerative
* Instantiation". Notice this theorem holds only for theories
* with compactness. For theories such as arithmetic,
* this class may introduce "default" terms that are
* used in instantiations, say 0 for arithmetic, even
* when the term 0 does not occur in the context.
*
* This strategy is not enabled by default, and
* is enabled by the option:
* --full-saturate-quant
*
* It is generally called with lower priority than
* other instantiation strategies, although this
* option interleaves it with other strategies
* during quantifier effort level QEFFORT_STANDARD:
* --fs-interleave
*/
class InstStrategyEnum : public QuantifiersModule
{
public:
InstStrategyEnum(QuantifiersState& qs,
QuantifiersInferenceManager& qim,
QuantifiersRegistry& qr,
TermRegistry& tr,
RelevantDomain* rd);
~InstStrategyEnum() {}
/** Presolve */
void presolve() override;
/** Needs check. */
bool needsCheck(Theory::Effort e) override;
/** Reset round. */
void reset_round(Theory::Effort e) override;
/** Check.
* Adds instantiations for all currently asserted
* quantified formulas via calls to process(...)
*/
void check(Theory::Effort e, QEffort quant_e) override;
/** Identify. */
std::string identify() const override
{
return std::string("InstStrategyEnum");
}
private:
/** Pointer to the relevant domain utility of quantifiers engine */
RelevantDomain* d_rd;
/** process quantified formula
*
* q is the quantified formula we are constructing instances for.
* fullEffort is whether we are called at full effort.
*
* If this function returns true, then one instantiation
* (determined by an enumeration) was added via a successful
* call to QuantifiersEngine::addInstantiation(...).
*
* If fullEffort is true, then we may introduce a "default"
* well-typed term *not* occurring in the current context.
* This handles corner cases where there are no well-typed
* ground terms in the current context to instantiate with.
*
* The flag isRd indicates whether we are trying relevant domain
* instantiations. If this flag is false, we are trying arbitrary ground
* term instantiations.
*/
bool process(Node q, bool fullEffort, bool isRd);
/**
* A limit on the number of rounds to apply this strategy, where a value < 0
* means no limit. This value is set to the value of fullSaturateLimit()
* during presolve.
*/
int32_t d_fullSaturateLimit;
}; /* class InstStrategyEnum */
} // namespace quantifiers
} // namespace theory
} // namespace CVC5
#endif
|
