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 theory_proxy.h
** \verbatim
** Original author: Dejan Jovanovic
** Major contributors: Liana Hadarean, Kshitij Bansal, Morgan Deters
** Minor contributors (to current version): Christopher L. Conway, Tim King
** This file is part of the CVC4 project.
** Copyright (c) 2009-2013 New York University and The University of Iowa
** See the file COPYING in the top-level source directory for licensing
** information.\endverbatim
**
** \brief SAT Solver.
**
** SAT Solver.
**/
#include "cvc4_private.h"
#ifndef __CVC4__PROP__SAT_H
#define __CVC4__PROP__SAT_H
// Just defining this for now, since there's no other SAT solver bindings.
// Optional blocks below will be unconditionally included
#define __CVC4_USE_MINISAT
#include "theory/theory.h"
#include "util/statistics_registry.h"
#include "context/cdqueue.h"
#include "prop/sat_solver.h"
namespace CVC4 {
class DecisionEngine;
class TheoryEngine;
namespace prop {
class PropEngine;
class CnfStream;
/**
* The proxy class that allows the SatSolver to communicate with the theories
*/
class TheoryProxy {
/** The prop engine we are using */
PropEngine* d_propEngine;
/** The CNF engine we are using */
CnfStream* d_cnfStream;
/** The decision engine we are using */
DecisionEngine* d_decisionEngine;
/** The theory engine we are using */
TheoryEngine* d_theoryEngine;
/** Queue of asserted facts */
context::CDQueue<TNode> d_queue;
/**
* Set of all lemmas that have been "shared" in the portfolio---i.e.,
* all imported and exported lemmas.
*/
std::hash_set<Node, NodeHashFunction> d_shared;
/**
* Statistic: the number of replayed decisions (via --replay).
*/
KEEP_STATISTIC(IntStat, d_replayedDecisions,
"prop::theoryproxy::replayedDecisions", 0);
public:
TheoryProxy(PropEngine* propEngine,
TheoryEngine* theoryEngine,
DecisionEngine* decisionEngine,
context::Context* context,
CnfStream* cnfStream);
~TheoryProxy();
void theoryCheck(theory::Theory::Effort effort);
void explainPropagation(SatLiteral l, SatClause& explanation);
void theoryPropagate(SatClause& output);
void enqueueTheoryLiteral(const SatLiteral& l);
SatLiteral getNextTheoryDecisionRequest();
SatLiteral getNextDecisionEngineRequest(bool& stopSearch);
bool theoryNeedCheck() const;
/**
* Notifies of a new variable at a decision level.
*/
void variableNotify(SatVariable var);
TNode getNode(SatLiteral lit);
void notifyRestart();
void notifyNewLemma(SatClause& lemma);
SatLiteral getNextReplayDecision();
void logDecision(SatLiteral lit);
void checkTime();
bool isDecisionEngineDone();
bool isDecisionRelevant(SatVariable var);
SatValue getDecisionPolarity(SatVariable var);
};/* class SatSolver */
/* Functions that delegate to the concrete SAT solver. */
inline TheoryProxy::TheoryProxy(PropEngine* propEngine,
TheoryEngine* theoryEngine,
DecisionEngine* decisionEngine,
context::Context* context,
CnfStream* cnfStream) :
d_propEngine(propEngine),
d_cnfStream(cnfStream),
d_decisionEngine(decisionEngine),
d_theoryEngine(theoryEngine),
d_queue(context)
{}
inline TheoryProxy::~TheoryProxy() {
/* nothing to do for now */
}
}/* CVC4::prop namespace */
}/* CVC4 namespace */
#endif /* __CVC4__PROP__SAT_H */
|
