gecoder-with-gecode 0.7.1 → 0.8.0

data/ext/gecode-2.1.1/contribs/qecode/configure.ac

@@ -0,0 +1,23 @@
+dnl
+dnl Author:
+dnl   Jeremie Vautard
+dnl
+dnl Copyright:
+dnl   Universit� d'Orleans, 2005
+dnl
+dnl Largely inspired from the map configure.ac file by Gr�goire Dooms
+
+
+AC_REVISION([$Revision$])
+AC_PREREQ(2.53)
+AC_INIT(QECODE, 1.2, jeremie.vautard@univ-orleans.fr)
+AC_CONFIG_SRCDIR(qecore.hh)
+
+dnl the names of the generated dlls
+AC_SUBST(QECODE,     "qecode")
+
+../../config.status --file Makefile.in:Makefile.in.in
+
+AC_CONFIG_COMMANDS([Makefile.in]) 
+AC_CONFIG_FILES([Makefile])
+AC_OUTPUT

data/ext/gecode-2.1.1/contribs/qecode/examples/COMPILING

@@ -0,0 +1,13 @@
+To compile the examples, you must add the qecode folder and the gecode folder (i.e. .. and ../../.. from this examples folder) to your include and library paths. These examples have to been linked against the gecodeint, gecodekernel, gecodeminimodel, gecodesupport, and gecodeqecode libraries. If you built the dynamic version of the gecode/qecode libraries, you will also have to add these folders to the dynamic libraries search path.
+
+Example (with dynamic libs) : 
+  For Linux, using gcc :
+    $ g++ stress_test.cpp -I.. -I../../.. -L.. -L../../.. -lgecodeqecode -lgecodeminimodel -lgecodeint -lgecodekernel -lgecodesupport -o stress_test
+    $ export LD_LIBRARY_PATH="..:../../.." # only if using shared libraries
+    $ ./stress_test
+
+  For MacOS, using gcc : 
+    $ g++ stress_test.cpp -I.. -I../../.. -L.. -L../../.. -lgecodeqecode -lgecodeminimodel -lgecodeint -lgecodekernel -lgecodesupport -o stress_test
+    $ export DYLD_LIBRARY_PATH="..:../../.." # only if using shared libraries
+    $ ./stress_test
+

data/ext/gecode-2.1.1/contribs/qecode/examples/MatrixGame.cpp

@@ -0,0 +1,144 @@
+/****   , [ MatrixGame.cpp ], 
+Copyright (c) 2007 Universite d'Orleans - Arnaud Lallouet 
+
+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 <cstdlib> /* pour srand, rand et RAND_MAX */
+#include <ctime> /* pour time */
+#include <math.h> /* pour pow */
+
+#include <iostream>
+
+#include "gecode/minimodel.hh"
+#include "gecode/int/element.hh"
+
+#include "qsolver.hh"
+#include "implicative.hh"
+#include "SDFVariableHeuristic.hh"
+#include "NaiveValueHeuristics.hh"
+
+#define UNIVERSAL true
+#define EXISTENTIAL false
+
+// The Matrix game consists in a square boolean matrix of size 2^depth. First player cuts it vertically in two parts and removes one half,
+// while secodn player do the same, but cutting the matrix horizontally. The game ends when there are only one cell left in the matrix. 
+// If this last cell has value 1, the first player wins. If it has value 0, the second player wins. 
+
+// The present model of this game is pure QBF, that QeCode can handle (though not as fast as QBF solvers...)
+
+using namespace MiniModel;
+
+int main (int argc, char * const argv[]) {
+    
+    int depth = 6;  // Size of the matrix is 2^depth. Larger values may take long to solve...
+    int nbDecisionVar = 2*depth;
+    int nbScope = nbDecisionVar+1;
+    int boardSize = (int)pow((double)2,(double)depth);
+    
+    std::srand(std::time(NULL));
+    
+    IntArgs board(boardSize*boardSize);
+    for (int i=0; i<boardSize; i++)
+        for (int j=0; j<boardSize; j++)
+            board[j*boardSize+i] = (int)( (double)rand()  /  ((double)RAND_MAX + 1) * 50 ) < 25 ? 0:1;
+    
+    IntArgs access(nbDecisionVar);
+    access[nbDecisionVar-1]=1;
+    access[nbDecisionVar-2]=boardSize;
+    for (int i=nbDecisionVar-3; i>=0; i--)
+        access[i]=access[i+2]*2;
+	
+    // debug
+    for (int i=0; i<boardSize; i++)
+    {
+        for (int j=0; j<boardSize; j++)
+            cout << board[j*boardSize+i] << " ";
+        cout << endl;
+	}
+    cout  << endl;
+    for (int i=0; i<nbDecisionVar; i++)
+        cout << access[i] << " ";
+    cout << endl;
+    // end debug
+    
+    int *scopesSize = new int[nbScope];
+    for (int i=0; i<nbScope-1; i++)
+        scopesSize[i]=1;
+    scopesSize[nbScope-1]=2;
+    
+    Implicative p(nbScope, QECODE_EXISTENTIAL, scopesSize);
+    
+    // Defining the variable of the n first scopes ...
+    for (int i=0; i<nbDecisionVar; i++)
+    {
+        p.QIntVar(i, 0, 1);
+        p.nextScope();
+    }
+	
+    // Declaring last scope variables ...
+    
+    p.QIntVar(nbDecisionVar, 0, 1);
+    p.QIntVar(nbDecisionVar+1, 0, boardSize*boardSize);
+    p.nextScope();
+    // Body
+    
+    post(p.space(), p.var(nbDecisionVar) == 1);
+    
+    IntVarArgs X(nbDecisionVar);
+    for (int i=0; i<nbDecisionVar; i++)
+        X[i]=p.var(i);
+    
+    linear(p.space(), access, X, IRT_EQ, p.var(nbDecisionVar+1));
+    //  MiniModel::LinRel R(E, IRT_EQ, MiniModel::LinExpr(p.var(nbDecisionVar+1)));
+    element(p.space(), board, p.var(nbDecisionVar+1), p.var(nbDecisionVar));
+    
+    // When every variables and constraints have been declared, the makeStructure method
+    // must be called in order to lead the problem ready for solving.
+    p.makeStructure();
+    
+    /*
+     cout << (p.quantification(0)==UNIVERSAL? "universal" : "existential") << "-0\n";
+     cout << "  " << (p.quantification(1)==UNIVERSAL? "universal" : "existential") << "-1\n";
+     cout << "    " << (p.quantification(2)==UNIVERSAL? "universal" : "existential") << "-2\n";
+     cout << "      " << (p.quantification(3)==UNIVERSAL? "universal" : "existential") << "-3\n";
+     cout << "        " << (p.quantification(4)==UNIVERSAL? "universal" : "existential") << "-4\n";
+     
+     */
+    
+    // We will use a Smallest Domain First branching heuristic for solving this problem.
+    SmallestDomainFirst heur;
+    SmallestValueFirst v_heur;
+    
+    // So, we build a quantified solver for our problem p, using the heuristic we just created.
+    QSolver solver(&p,&heur, &v_heur);
+    
+    unsigned long int nodes=0;
+    unsigned long int steps=0;
+    
+    // then we solve the problem. Nodes and Steps will contain the number of nodes encountered and
+    // of propagation steps achieved during the solving.
+    bool outcome = solver.solve(nodes,steps);
+    
+    cout << "  outcome: " << ( outcome? "TRUE" : "FALSE") << endl;
+    cout << "  nodes visited: " << nodes << " " << steps << endl;
+    
+    return outcome? 10:20;
+    
+}

data/ext/gecode-2.1.1/contribs/qecode/examples/NimFibo.cpp

@@ -0,0 +1,73 @@
+/****   , [ NimFibo.cpp ], 
+Copyright (c) 2007 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.hh"
+#include "implicative.hh"
+#include "SDFVariableHeuristic.hh"
+#include "NaiveValueHeuristics.hh"
+#include "FirstFailValueHeuristic.hh"
+
+///////////////////////////////////////////////////////////////////////////////////////////
+// This is a model of the nim-fibonacci game. We have a N matches set. First player may  //
+// take between 1 and N-1 matches. Then, each player may take at most twice the number of//
+// matches taken by the last player. Take the last match to win !                        //
+///////////////////////////////////////////////////////////////////////////////////////////
+
+int main() {
+    int N = 20; // Initial number of matches
+    
+    int* scopeSize = new int[N+2];
+    for (int i=0;i<N+2;i++) 
+        scopeSize[i] = 2;
+    
+    Implicative p(N+2,QECODE_EXISTENTIAL,scopeSize);
+    
+    p.QIntVar(0,1,N-1);
+    p.QIntVar(1,0,N);
+    post(p.space(),p.var(0) == p.var(1));
+    p.nextScope();
+    
+    for (int i=1;i<N+2;i++) {
+        p.QIntVar(2*i , 1, N-1);
+        p.QIntVar(2*i + 1, 0, N);
+        post(p.space(), p.var(2*i) <= 2*p.var(2*(i-1)));
+        post(p.space(), p.var(2*i + 1) == p.var(2*i) + p.var(2*i - 1));
+        p.nextScope();
+    }
+    
+    p.makeStructure();
+    
+    SmallestDomainFirst heur;
+//    SmallestValueFirst v_heur;
+    FirstFailValue v_heur;
+    QSolver s(&p,&heur,&v_heur);
+    
+    unsigned long int nodes=0;
+    unsigned long int propsteps=0;
+    
+    bool outcome  = s.solve(nodes,propsteps);
+    
+    cout << "  outcome: " << ( outcome ? "TRUE" : "FALSE") << endl;
+    cout << "  nodes visited: " << nodes << " " << propsteps << endl;
+    
+    return outcome ? 10:20;
+}

data/ext/gecode-2.1.1/contribs/qecode/examples/stress_test.cpp

@@ -0,0 +1,179 @@
+/****   , [ stress_test.cpp ], 
+Copyright (c) 2007 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.hh"
+#include "implicative.hh"
+#include "SDFVariableHeuristic.hh"
+#include "NaiveValueHeuristics.hh"
+
+
+// This is a set of tiny problems which are used to dtect errors in QeCode. 
+// This set is likely to progressively enlarge...
+
+int main() {
+    unsigned long int nodes;
+    unsigned long int steps;
+    SmallestDomainFirst heur;
+    SmallestValueFirst vHeur;
+    
+    // Ax in 1..3 []  -> x=1
+    int sc1[] = {1};
+    Implicative test1(1,QECODE_UNIVERSAL,sc1);
+    test1.QIntVar(0,1,3);
+    test1.nextScope();
+    post(test1.space(),test1.var(0) == 1);
+    test1.makeStructure();
+    QSolver s1(&test1,&heur,&vHeur);
+    nodes=0;
+    steps=0;
+    bool ret1=s1.solve(nodes,steps);
+    cout<<"Problem 1 : result = "<<(ret1?"TRUE":"FALSE")<<", sould be FALSE."<<endl;
+    cout<<nodes<<" nodes and "<<steps<<" steps."<<endl;
+    
+    
+    //Ex in 1..3 [] st x=1
+    int sc2[] = {1};
+    Implicative test2(1,QECODE_EXISTENTIAL,sc2);
+    test2.QIntVar(0,1,3);
+    test2.nextScope();
+    post(test2.space(),test2.var(0) == 1);
+    test2.makeStructure();
+    QSolver s2(&test2,&heur,&vHeur);
+    nodes=0;
+    steps=0;
+    bool ret2=s2.solve(nodes,steps);
+    cout<<"Problem 2 : result = "<<(ret2?"TRUE":"FALSE")<<", sould be TRUE."<<endl;
+    cout<<nodes<<" nodes and "<<steps<<" steps."<<endl;
+    
+    
+    
+    //Ax in 1..3 [x=1] -> x=2
+    int sc3[] = {1};
+    Implicative test3(1,QECODE_UNIVERSAL,sc3);
+    test3.QIntVar(0,1,3);
+    post(test3.space(),test3.var(0) == 1);
+    test3.nextScope();
+    post(test3.space(),test3.var(0) == 2);
+    test3.makeStructure();;
+    QSolver s3(&test3,&heur,&vHeur);
+    nodes=0;
+    steps=0;
+    bool ret3=s3.solve(nodes,steps);
+    cout<<"Problem 3 : result = "<<(ret3?"TRUE":"FALSE")<<", sould be FALSE."<<endl;
+    cout<<nodes<<" nodes and "<<steps<<" steps."<<endl;
+    
+    
+    // Ex in 1..3 [x=1] st x=2
+    int sc4[] = {1};
+    Implicative test4(1,QECODE_EXISTENTIAL,sc4);
+    test4.QIntVar(0,1,3);
+    post(test4.space(),test4.var(0) == 1);
+    test4.nextScope();
+    post(test4.space(),test4.var(0) == 2);
+    test4.makeStructure();
+    QSolver s4(&test4,&heur,&vHeur);
+    nodes=0;
+    steps=0;
+    bool ret4=s4.solve(nodes,steps);
+    cout<<"Problem 4 : result = "<<(ret4?"TRUE":"FALSE")<<", sould be FALSE."<<endl;
+    cout<<nodes<<" nodes and "<<steps<<" steps."<<endl;
+    
+    
+    // Ax in 1..3 [x=1] -> Ey in 1..3 [x=2] -> y=1
+    int sc5[] = {1,1};
+    Implicative test5(2,QECODE_UNIVERSAL,sc5);
+    test5.QIntVar(0,1,3);
+    test5.QIntVar(1,1,3);
+    post(test5.space(),test5.var(0) == 1);
+    test5.nextScope();
+    post(test5.space(),test5.var(0) == 2);
+    test5.nextScope();
+    post(test5.space(),test5.var(1) == 1);
+    test5.makeStructure();
+    QSolver s5(&test5,&heur,&vHeur);
+    nodes=0;
+    steps=0;
+    bool ret5=s5.solve(nodes,steps);
+    cout<<"Problem 5 : result = "<<(ret5?"TRUE":"FALSE")<<", sould be FALSE."<<endl;
+    cout<<nodes<<" nodes and "<<steps<<" steps."<<endl;
+    
+
+    // Ax in 1..3 [x=1] -> Ey in 1..3 [x=1] -> x=2    
+    int sc6[] = {1,1};
+    Implicative test6(2,QECODE_UNIVERSAL,sc6);
+    test6.QIntVar(0,1,3);
+    test6.QIntVar(1,1,3);
+    post(test6.space(),test6.var(0) == 1);
+    test6.nextScope();
+    post(test6.space(),test6.var(0) == 1);
+    test6.nextScope();
+    post(test6.space(),test6.var(0) == 2);
+    test6.makeStructure();
+    QSolver s6(&test6,&heur,&vHeur);
+    nodes=0;
+    steps=0;
+    bool ret6=s6.solve(nodes,steps);
+    cout<<"Problem 6 : result = "<<(ret6?"TRUE":"FALSE")<<", sould be FALSE."<<endl;
+    cout<<nodes<<" nodes and "<<steps<<" steps."<<endl;
+    
+    
+    //Ex in 1..3 [] Ay in 0..3 [y<2] -> y=0
+    int sc7[] = {1,1};
+    Implicative test7(2,QECODE_EXISTENTIAL,sc7);
+    test7.QIntVar(0,1,3);
+    test7.QIntVar(1,0,3);
+    test7.nextScope();
+    post(test7.space(),test7.var(1) <= 2);
+    test7.nextScope();
+    post(test7.space(),test7.var(1) == 0);
+    test7.makeStructure();
+    QSolver s7(&test7,&heur,&vHeur);
+    nodes=0;
+    steps=0;
+    bool ret7=s7.solve(nodes,steps);
+    cout<<"Problem 7 : result = "<<(ret7?"TRUE":"FALSE")<<", sould be FALSE."<<endl;
+    cout<<nodes<<" nodes and "<<steps<<" steps."<<endl;
+    
+    
+    //Ex in 1..3 [] Ay in 0..3 [y=0] -> y=0    
+    int sc8[] = {1,1};
+    Implicative test8(2,QECODE_EXISTENTIAL,sc8);
+    test8.QIntVar(0,1,3);
+    test8.QIntVar(1,0,3);
+    test8.nextScope();
+    post(test8.space(),test8.var(1) == 0);
+    test8.nextScope();
+    post(test8.space(),test8.var(1) == 0);
+    test8.makeStructure();
+    QSolver s8(&test8,&heur,&vHeur);
+    nodes=0;
+    steps=0;
+    bool ret8=s8.solve(nodes,steps);
+    cout<<"Problem 8 : result = "<<(ret8?"TRUE":"FALSE")<<", sould be TRUE."<<endl;
+    cout<<nodes<<" nodes and "<<steps<<" steps."<<endl;
+    
+    
+    
+    
+}
+    
+    

data/ext/gecode-2.1.1/contribs/qecode/extensivecomparator.cc

@@ -0,0 +1,34 @@
+/*****************************************************************[extensivecomparator.cc]
+Copyright (c) 2007, Universite d'Orleans - Jeremie Vautard, Marco Benedetti,
+Arnaud Lallouet.
+
+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 "extensivecomparator.hh"
+
+
+ExtensiveComparator::ExtensiveComparator(int the_size, int* the_scores) {
+  size=the_size; scores=the_scores;
+}
+
+
+bool ExtensiveComparator::operator() (int a, int b) {
+  if (a>size || b>size) return (a<b);
+  return (scores[a]<scores[b]);
+}