Hi, you could use Gecode to model a MAX-SAT problem, by using reified clause constraints and then maximising the sum over the control variables for the clauses. However the performance will be very, very poor compared to a dedicated MAX-SAT solver.
Cheers Guido -- GUIDO TACK Senior Lecturer Information Technology Monash University Level 6, Room 6.40, Building H, Caulfield Campus 900 Dandenong Road Caulfield East VIC 3145 Australia T: +61 3 9903 1214 E: [email protected] <mailto:[email protected]> http://www.csse.monash.edu/~guidot/ <http://www.csse.monash.edu/~guidot/> > On 22 Oct. 2016, at 6:03 am, Assia benziane <[email protected] > <mailto:[email protected]>> wrote: > > Hello gecode users, > > I've a constraint satisfaction problem that i want to optimize. My idea is to > implment it on Gecode. I read closely the document "Modeling and Programming > with Gecode <http://www.gecode.org/doc-latest/MPG.pdf>", but i did not found > anything related to use the MAX-SAT on Gecode straight. My question is if it > is possible to implment a MAX-SAT problem on Gecode. > > Cordially, > --- > Assia > _______________________________________________ > Gecode users mailing list > [email protected] <mailto:[email protected]> > https://www.gecode.org/mailman/listinfo/gecode-users > <https://www.gecode.org/mailman/listinfo/gecode-users>
_______________________________________________ Gecode users mailing list [email protected] https://www.gecode.org/mailman/listinfo/gecode-users
