blob: e88e99a83a95a8c609edc9013f45102eeb14375d (
plain)
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
|
/********************* */
/*! \file quant_split.h
** \verbatim
** Top contributors (to current version):
** Andrew Reynolds, Mathias Preiner
** 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 dynamic quantifiers splitting
**/
#include "cvc4_private.h"
#ifndef CVC4__THEORY__QUANT_SPLIT_H
#define CVC4__THEORY__QUANT_SPLIT_H
#include "context/cdo.h"
#include "theory/quantifiers/quant_util.h"
namespace CVC4 {
namespace theory {
class QuantifiersEngine;
namespace quantifiers {
class QuantDSplit : public QuantifiersModule {
typedef context::CDHashSet<Node, NodeHashFunction> NodeSet;
private:
/** list of relevant quantifiers asserted in the current context */
std::map< Node, int > d_quant_to_reduce;
/** whether we have instantiated quantified formulas */
NodeSet d_added_split;
public:
QuantDSplit( QuantifiersEngine * qe, context::Context* c );
/** determine whether this quantified formula will be reduced */
void checkOwnership(Node q) override;
/* whether this module needs to check this round */
bool needsCheck(Theory::Effort e) override;
/* Call during quantifier engine's check */
void check(Theory::Effort e, QEffort quant_e) override;
/* Called for new quantifiers */
void registerQuantifier(Node q) override {}
void assertNode(Node n) override {}
bool checkCompleteFor(Node q) override;
/** Identify this module (for debugging, dynamic configuration, etc..) */
std::string identify() const override { return "QuantDSplit"; }
};
}
}
}
#endif
|
