blob: 0a8f046b7ff647b5281c9fdcbbc4ca54082ebc17 (
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
|
/********************* */
/*! \file bv_subtheory_eq_bitblast.h
** \verbatim
** Original author: lianah
** Major contributors: dejan
** Minor contributors (to current version): none
** This file is part of the CVC4 prototype.
** Copyright (c) 2009, 2010, 2011 The Analysis of Computer Systems Group (ACSys)
** Courant Institute of Mathematical Sciences
** New York University
** See the file COPYING in the top-level source directory for licensing
** information.\endverbatim
**
** \brief Algebraic solver.
**
** Algebraic solver.
**/
#pragma once
#include "theory/bv/bv_subtheory.h"
namespace CVC4 {
namespace theory {
namespace bv {
class Bitblaster;
/**
* BitblastSolver
*/
class BitblastSolver : public SubtheorySolver {
/** Bitblaster */
Bitblaster* d_bitblaster;
/** Nodes that still need to be bit-blasted */
context::CDQueue<TNode> d_bitblastQueue;
public:
BitblastSolver(context::Context* c, TheoryBV* bv);
~BitblastSolver();
void preRegister(TNode node);
bool addAssertions(const std::vector<TNode>& assertions, Theory::Effort e);
void explain(TNode literal, std::vector<TNode>& assumptions);
EqualityStatus getEqualityStatus(TNode a, TNode b);
};
}
}
}
|
