logopt.cc

#include<scil/scil.h>
#include<scil/core/boolfunction.h>
#include<iostream>
#include<sstream>
#include<stack>
#include<sstream>

using namespace SCIL;
using namespace std;


struct bfElement{
   public:
   boolfunction* bf;
   boolOperator op;
   bfElement(var v) { 
      bf = new boolfunction(v);
      op=BASIC;
   };
   bfElement(boolfunction* _bf){
      bf = _bf;
      op = BASIC;
   };
};

struct bfStack {
   stack<bfElement> st;
   bool negated;
   bfStack(bool neg){
      negated=neg;
   };
   bfElement& top(){
      return st.top();
   };
   void pop(){
      st.pop();
   };
   void push(bfElement bfE){
      st.push(bfE);
   };
   bool empty(){
      return st.empty();
   };
};

//creates a boolfunction based on an input string buf
boolfunction* read_boolfunction(string buf, ILP_Problem& IP, map<string,var>& varMap) {
   pair<map<string,var>::iterator, bool> newPair;
   map<string, var>::iterator mapIt;
   stack<bfStack> mainStack;
   mainStack.push(bfStack(false));
   istringstream iss(buf);
   string s;
   while(!iss.eof()) {
      iss >> s;
      switch (s[0]) {
         case '&':
            mainStack.top().top().op=AND;
            break;
         case '^':
            mainStack.top().top().op=XOR;
            break;
         case '|':
            mainStack.top().top().op=OR;
            break;
         case '=':
            mainStack.top().top().op=EQU;
            break;
         case '<':
            mainStack.top().top().op=PMI;
            break;
         case '>':
            mainStack.top().top().op=IMP;
            break;
         default:
            int front=0; 
            int back=s.size()-1;
            bool found = false;
            while(found == false) {
               switch (s[front]) {
                  case '!':
                     front++;
                     mainStack.push(bfStack(true));
                     break;
                  case '(':
                     front++;
                     mainStack.push(bfStack(false));
                     break;
                  default:
                     if(s[back] == ')'){
                        back--;
                     } else
                        found=true;
                     break;
               }
            }
            string varName = s.substr(front, back-front+1);
            mapIt=varMap.find(varName);
            if(mapIt == varMap.end()){
               varMap.insert(make_pair(varName, IP.add_binary_variable(.0)));
            }
            mainStack.top().push(bfElement(varMap[varName]));
            for(int k=0; k<s.size()-1-back; k++) {
               if(mainStack.top().negated)
                  k--;
               bfStack bfs = mainStack.top();
               mainStack.pop();
               boolfunction* bf = bfs.top().bf->copy();
               delete bfs.top().bf;
               bfs.pop();
               while(!bfs.empty()){
                  bf->add(bfs.top().bf,bfs.top().op);
                  delete bfs.top().bf;
                  bfs.pop();
               }
               if(bfs.negated)
                  bf->negate();
               mainStack.top().push(bfElement(bf));
            }
      }
   }
   boolfunction* bf;
   while(!mainStack.empty()){
      bfStack bfs = mainStack.top();
      mainStack.pop();
      bf = bfs.top().bf->copy();
      delete bfs.top().bf;
      bfs.pop();
      while(!bfs.empty()){
         bf->add(bfs.top().bf,bfs.top().op);
         delete bfs.top().bf;
         bfs.pop();
      }
      if(bfs.negated)
         bf->negate();
      if(!mainStack.empty())
         mainStack.top().push(bfElement(bf));
   }
   return bf;
}

void read_instance(char* infile, ILP_Problem &IP, map<string,var> &varMap) {

   string path(infile);
   ifstream file(path.c_str());
   if(file.fail()) {
      cerr<<"no file with name "<< infile<<" found!"<< endl;
      exit(1);
   }
   string s,t;
   char buf[1024];
   size_t pos, pos_alt;
   file >> s;
   while(s != "START")
      file >> s;
   while(s != "END")
   {
      file >> s;
      istringstream iss(s);
      double coeff;
      //if iss is a number, add a new boolfunction to objectivfunction
      if( iss >> coeff)
      {
         file.getline(buf, 1024);
         IP.add_boolfunction(read_boolfunction(buf, IP, varMap), coeff);
      }
      //if iss is a keyword add the corresponding constraint
      else {
         file.getline(buf, 1024);
         if (s == "C0")
            IP.add_bool_constraint(read_boolfunction(buf, IP, varMap), C0);
         else if ( s == "C1")
            IP.add_bool_constraint(read_boolfunction(buf, IP, varMap), C1);
         else if ( s == "CS"|| s == "CE") {
            list<boolfunction*> bf_list;
            t = buf;
            pos = 0;
            pos_alt = 0;
            while(pos != string::npos) {
               pos = t.find_first_of(';', pos);
               if ( pos != string::npos){
                  bf_list.push_back(read_boolfunction(t.substr(pos_alt, pos-pos_alt), IP, varMap));
                  pos++;
                  pos_alt=pos;
               } else 
                  bf_list.push_back(read_boolfunction(t.substr(pos_alt),IP, varMap));
            }
            if(s == "CS")
               IP.add_bool_constraint(bf_list, CS);
            else
               IP.add_bool_constraint(bf_list, CE);
         }
      }
   }
}


int main(int argc, char** argv) {
   //create a new ILP problem
   ILP_Problem IP(Optsense_Max);
   
   //read an inputfile
   map<string, var> varMap;
   read_instance(argv[1], IP, varMap);

   //optimize
   IP.optimize();

   //examine the solution
   cout<<"Optimal solution value: "<<IP.get_optimum()<<endl;
   for(map<string,var>::iterator it = varMap.begin(); it != varMap.end(); it++)
      cout<<it->first<<": "<<IP.get_solution(it->second)<<endl;
}

---