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
|
/**** , [ QCSP_Solver.cc ],
Copyright (c) 2008 Universite d'Orleans - Jeremie Vautard
Permission is hereby granted, free of charge, to any person obtaining a copy
of this software and associated documentation files (the "Software"), to deal
in the Software without restriction, including without limitation the rights
to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
copies of the Software, and to permit persons to whom the Software is
furnished to do so, subject to the following conditions:
The above copyright notice and this permission notice shall be included in
all copies or substantial portions of the Software.
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
THE SOFTWARE.
*************************************************************************/
#include "qsolver_qcsp.hh"
#include <climits>
inline vector<int> getTheValues(MySpace* sol,int vmin,int vmax)
{
vector<int> zevalues;
// cout<<sol<<" "<<vmin<<" "<<vmax<<endl;
if (vmax > (sol->nbVars())) cout<<"getTheValues mal appele"<<endl;
for (int i = vmin; i<=vmax; i++) {
// cout<<i<<" ";
// cout.flush();
switch (sol->type_of_v[i]) {
case VTYPE_INT :
zevalues.push_back( (static_cast<IntVar*>(sol->v[i]))->val() );
break;
case VTYPE_BOOL :
zevalues.push_back( (static_cast<BoolVar*>(sol->v[i]))->val() );
break;
default :
cout<<"4Unknown variable type"<<endl;
abort();
}
}
// cout<<endl;
return zevalues;
}
QCSP_Solver::QCSP_Solver(Qcop* sp)
{
this->sp = sp;
nbRanges=new int;
}
Strategy QCSP_Solver::solve(unsigned long int& nodes, unsigned int limit,bool allStrategies)
{
this->limit=limit;
MySpace* espace=sp->getSpace(0);
Options o;
Engine* solutions = new WorkerToEngine<Gecode::Search::Sequential::DFS>(espace,/*sizeof(MySpace),*/o);
return rSolve(sp,0,solutions,nodes,allStrategies);
}
Strategy QCSP_Solver::rSolve(Qcop* qs,int scope,Engine* L, unsigned long int& nodes,bool allStrategies)
{
nodes++;
MySpace* sol = static_cast<MySpace*>(L->next());
Strategy ret=Strategy::Dummy();
bool LwasEmpty = true;
bool atLeastOneExistential = false;
while ((sol != NULL) ) {
LwasEmpty=false;
vector<int> assignments = getTheValues(sol,0,sol->nbVars()-1);
Strategy result;
if (scope == (qs->spaces() - 1) ) { // last scope reached. Verify the goal...
MySpace* g = qs->getGoal();
for (int i=0; i<g->nbVars(); i++) {
switch (g->type_of_v[i]) {
case VTYPE_INT :
rel(*g,*(static_cast<IntVar*>(g->v[i])) == assignments[i]);
break;
case VTYPE_BOOL :
rel(*g,*(static_cast<BoolVar*>(g->v[i])) == assignments[i]);
break;
default :
cout<<"Unknown variable type"<<endl;
abort();
}
}
Gecode::DFS<MySpace> solutions(g);
MySpace* goalsol = solutions.next();
if (goalsol == NULL) {
delete g;
result = Strategy::SFalse();
} else {
int vmin = ( (scope==0)? 0 : (qs->nbVarInScope(scope-1)) );
int vmax = (qs->nbVarInScope(scope))-1;
vector<int> zevalues=getTheValues(sol,vmin,vmax);
result = Strategy::STrue();
// result=Strategy(qs->quantification(scope),vmin,vmax,scope,zevalues);
// result.attach(Strategy::STrue());
delete g;
// delete sol;
delete goalsol;
}
}
else { // This is not the last scope...
MySpace* espace = qs->getSpace(scope+1);
for (int i=0; i<assignments.size(); i++) {
switch (espace->type_of_v[i]) {
case VTYPE_INT :
rel(*espace,*(static_cast<IntVar*>(espace->v[i])) == assignments[i]);
break;
case VTYPE_BOOL :
rel(*espace,*(static_cast<BoolVar*>(espace->v[i])) == assignments[i]);
break;
default :
cout<<"Unknown variable type"<<endl;
abort();
}
}
Options o;
Engine* solutions = new WorkerToEngine<Gecode::Search::Sequential::DFS>(espace,/*sizeof(MySpace),*/o);
delete espace;
result=rSolve(qs,scope+1,solutions,nodes,allStrategies);
}
int vmin = ( (scope == 0) ? 0 : (qs->nbVarInScope(scope-1)) );
int vmax = (qs->nbVarInScope(scope))-1;
vector<int> zevalues=getTheValues(sol,vmin,vmax);
delete sol;
if (qs->quantification(scope)) { // current scope is universal
if (result.isFalse()) { // one branch fails
delete L;
return Strategy::SFalse();
} else {
Strategy toAttach(true,vmin,vmax,scope,zevalues);
toAttach.attach(result);
ret.attach(toAttach);
}
} else { //current scope is existential
if (!result.isFalse()) { // result is not the trivially false strategy...
atLeastOneExistential =true;
Strategy toAttach;
if (allStrategies) {
// We want to save every possible strategies. Each correct existential branch will be saved
if (scope >= limit) toAttach = Strategy::STrue();
else {
toAttach = Strategy(qs->quantification(scope),vmin,vmax,scope,zevalues);
toAttach.attach(result);
}
ret.attach(toAttach);
} else {
//We want only one possible strategy. We found an assignment which leads to a valid substrategy. So, we return it immediately
delete L;
if (scope >= limit) return Strategy::STrue();
ret = Strategy(qs->quantification(scope),vmin,vmax,scope,zevalues);
ret.attach(result);
return ret;
}
}
}
sol = static_cast<MySpace*>(L->next());
}
delete L;
if (scope>limit)
ret = Strategy::STrue();
if (qs->quantification(scope)) //universal scope
return (LwasEmpty ? Strategy::STrue() : ret);
else // existnetial Scope
return (atLeastOneExistential ? ret : Strategy::SFalse());
}
|
