Re: cnf-sat solver interface

Andrew Makhorin <[email protected]>
Newsgroups gmane.comp.gnu.glpk
Message-ID <1495696238.4627.11.camel@corvax>
> > > I wouldn't like to include a C++ code in glpk. It seems to me that a
> > > better way would be to add an API routine that allows to set up an
> > > user-provided CNF-SAT solver (which is, for example, minisat by
> > > default).
> > 
> > My plan is to link with the library that provides a C interface.
> > However, when I looked at it a few months ago, the semantics of the
> > interface looked a bit different to those of the current code so this
> > was not so easy to test quickly.
> > 
> 
> CNF-SAT is a very important class of combinatorial problems, so maybe it
> would be reasonable to include in glpk a program object, say, glp_cnf,
> available on api level, and use it as an interface to CNF-SAT solvers.
> Another way is to use glp_graph, since CNF-SAT can be represented as a
> bipartite graph.
> 

BTW, you may look at glpk/src/glpspm.h. The internal program object SPM
(general sparse matrix) is suitable to represent CNF-SAT, where rows
represent clauses and columns represent Boolean variables.
lmpx.com only provides a reader for public news (NNTP) servers. It is not affiliated with the servers or forums shown here and is not responsible for the content of articles, which is written by their respective authors.