blob: 161049b21df261512a3773201ccc881cf1b4d22e (
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
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
|
// Copyright 2008, 2009 Brady J. Garvin
// This file is part of Covering Arrays by Simulated Annealing (CASA).
// CASA is free software: you can redistribute it and/or modify it
// under the terms of the GNU General Public License as published by
// the Free Software Foundation, either version 3 of the License, or
// (at your option) any later version.
// CASA is distributed in the hope that it will be useful, but
// WITHOUT ANY WARRANTY; without even the implied warranty of
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
// GNU General Public License for more details.
// You should have received a copy of the GNU General Public License
// along with CASA. If not, see <http://www.gnu.org/licenses/>.
// Other SAT solvers can be substituted by altering SAT.H and SAT.C.
#include "sat/SAT.H"
InputClause::InputClause() :
maxVariable(-1) {}
InputClause::InputClause(Array<InputTerm>terms) :
maxVariable(-1) {
unsigned size = terms.getSize();
for (unsigned i = 0; i < size; ++i) {
append(terms[i]);
}
}
InputClause::InputClause(Array<unsigned>symbols) :
maxVariable(-1) {
unsigned size = symbols.getSize();
for (unsigned i = 0; i < size; ++i) {
append(InputTerm(false, symbols[i]));
}
}
InputClause::~InputClause() {}
InputClause::operator vec<Lit>&() {
return literals;
}
InputClause::operator const vec<Lit>&() const {
return literals;
}
void InputClause::clear(){
literals.clear();
}
void InputClause::append(InputTerm term) {
int variable = term.getVariable();
if (variable > maxVariable) {
maxVariable = variable;
}
literals.push(term.isNegated() ? ~Lit(variable) : Lit(variable));
}
void InputClause::undoAppend() {
literals.pop();
}
void SATSolver::reserve(int variables) {
while (variables >= solver.nVars()) {
solver.newVar();
}
}
void SATSolver::addClause(InputClause&clause) {
reserve(clause.getMaxVariable());
solver.addClause(clause);
}
bool SATSolver::operator()(const InputKnown&known) {
reserve(known.getMaxVariable());
return solver.simplify() && solver.solve(known);
}
|
