blob: 0dd3467f63a2ef015e168c3c119fcd5773472ee0 (
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
82
83
84
85
86
87
88
89
90
91
92
|
// 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.
#ifndef SAT_H
#define SAT_H
#include "Array.H"
#include "Solver.H"
// A literal in a SAT clause.
class InputTerm {
protected:
int encoding;
public:
InputTerm() :
encoding(0) {}
InputTerm(int encoding) :
encoding(encoding) {}
InputTerm(bool negated, int variable) :
encoding( (variable << 1) | (int)negated) {}
operator int() const {
return encoding;
}
InputTerm&operator =(int encoding) {
this->encoding = encoding;
return *this;
}
bool isNegated() const {
return encoding & 1;
}
int getVariable() const {
return encoding >> 1;
}
};
// A SAT clause.
class InputClause {
protected:
int maxVariable;
vec<Lit> literals;
public:
InputClause();
InputClause(Array<InputTerm>terms);
InputClause(Array<unsigned>symbols);
virtual ~InputClause();
operator vec<Lit>&();
operator const vec<Lit>&() const;
int getMaxVariable() const {
return maxVariable;
}
void clear();
void append(InputTerm term);
void undoAppend();
};
// A partial assignment.
typedef InputClause InputKnown;
// A solver-wrapping class.
class SATSolver {
protected:
// The miniSAT implementation.
Solver solver;
public:
void reserve(int variables);
void addClause(InputClause&clause);
bool operator ()(const InputKnown&known);
};
#endif
|
