/
CNFGenerator.cpp
191 lines (162 loc) · 4.38 KB
/
CNFGenerator.cpp
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
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
#include "CNFGenerator.h"
int CNFGenerator::globalClauseCount=0;
CNFGenerator::CNFGenerator(int t, int p):tables(t),people(p)
{
PersonAtTable.resize(tables);
for (int i=0;i<PersonAtTable.size();i++)
PersonAtTable[i].resize(people);
Relationships.resize(people);
}
bool CNFGenerator::loadRelationshipFromVector(const vector<string> & relationsMatrix)
{
short tempRel;
for (int i=0;i<people;i++)
{
stringstream temp (relationsMatrix[i]);
//cout << temp.str() <<endl;
while (1)
{
temp >> tempRel;
if (!temp)
break;
Relationships[i].push_back(tempRel);
}
//cout << endl;
}
cout<<"relationship"<<endl;
for (int i=0;i<Relationships.size();i++)
{
for (int j=0;j<Relationships[i].size();j++)
{
cout<<Relationships[i][j]<<"\t";
}
cout<<endl;
}
for (int i =0;i<people;i++)
{
for (int j =0;j<i;j++)
{
if (Relationships[i][j]==1)
Friends.push_back(pair<short,short>(i,j));
else if (Relationships[i][j]==-1)
Enemies.push_back(pair<short,short>(i,j));
}
}
return true;
}
bool CNFGenerator::GenerateCNF()
{
OnePersonOneTable();
FriendsGenerator();
EnemiesGenerator();
printCNF();
/*
sort(SetOfClauses.begin(),SetOfClauses.end());
ClauseSet::iterator lastUniquePoint = unique(SetOfClauses.begin(),SetOfClauses.end());
SetOfClauses.resize(distance(SetOfClauses.begin(),lastUniquePoint));
*/
return true;
}
bool CNFGenerator::FriendsGenerator()
{
Clause newFriendClause1;
Clause newFriendClause2;
for (vector<pair <short,short> >::iterator it = Friends.begin();it!=Friends.end();it++)
{
for (int i =0; i< tables;i++)
{
newFriendClause1.clear();
newFriendClause2.clear();
Literal newLiteral1(it->first,i,true);
Literal newLiteral2(it->second,i,false);
newFriendClause1.insert(newLiteral1);
newFriendClause1.insert(newLiteral2);
//sort(newFriendClause1.begin(),newFriendClause1.end());
Literal newLiteral3(it->first,i,false);
Literal newLiteral4(it->second,i,true);
newFriendClause2.insert(newLiteral3);
newFriendClause2.insert(newLiteral4);
//sort(newFriendClause2.begin(),newFriendClause2.end());
SetOfClauses.insert(pair<Clause,int>(newFriendClause1,++CNFGenerator::globalClauseCount));
SetOfClauses.insert(pair<Clause,int> (newFriendClause2,++CNFGenerator::globalClauseCount));
}
}
return true;
}
bool CNFGenerator::EnemiesGenerator()
{
Clause newEnemyClause;
for (vector<pair <short,short> >::iterator it = Enemies.begin();it!=Enemies.end();it++)
{
for (int i =0; i< tables;i++)
{
newEnemyClause.clear();
Literal newLiteral1(it->first,i,true);
Literal newLiteral2(it->second,i,true);
newEnemyClause.insert(newLiteral1);
newEnemyClause.insert(newLiteral2);
//sort(newEnemyClause.begin(),newEnemyClause.end());
SetOfClauses.insert(pair<Clause,int>(newEnemyClause,++CNFGenerator::globalClauseCount));
}
}
return true;
}
bool CNFGenerator::OnePersonOneTable()
{
Clause onePersonAtLeastOneTable;
Clause onePersonAtMaxOneTable;
for (int i =0;i<people;i++)
{
onePersonAtLeastOneTable.clear();
onePersonAtMaxOneTable.clear();
//cout <<"atleast 1 =";
for (int j=0;j<tables;j++)
{
Literal newLiteral(i,j,false);
//cout <<newLiteral;
onePersonAtLeastOneTable.insert(newLiteral);
}
//cout<<endl;
//sort(onePersonAtLeastOneTable.begin(),onePersonAtLeastOneTable.end());
SetOfClauses.insert(pair<Clause,int> (onePersonAtLeastOneTable,++CNFGenerator::globalClauseCount));
for (int j=0;j<tables;j++)
{
for (int k=j+1;k<tables;k++)
{
onePersonAtMaxOneTable.clear();
Literal newLiteral1(i,j,true);
Literal newLiteral2(i,k,true);
onePersonAtMaxOneTable.insert(newLiteral1);
onePersonAtMaxOneTable.insert(newLiteral2);
//sort(onePersonAtMaxOneTable.begin(),onePersonAtMaxOneTable.end());
SetOfClauses.insert(pair<Clause,int> (onePersonAtMaxOneTable,++CNFGenerator::globalClauseCount));
}
}
}
return true;
}
bool CNFGenerator::printCNF()
{
bool firstRecord;
for (ClauseSet::iterator setIterator= SetOfClauses.begin();setIterator!= SetOfClauses.end();setIterator++)
{
firstRecord=true;
for (Clause::iterator clauseIter = (setIterator->first).begin();clauseIter != (setIterator->first).end(); clauseIter++ )
{
if (firstRecord)
{
cout<<*clauseIter ;
firstRecord=false;
}
else
{
cout<<" V " << *clauseIter ;
}
}
cout << endl;
}
return true;
}
CNFGenerator::~CNFGenerator()
{
}