TCS / Research / Publications / A Compact Reformulation of Propositional Satisfiability as Binary Constraint Satisfaction
Helsinki University of Technology, 
     Laboratory for Theoretical Computer Science

A Compact Reformulation of Propositional Satisfiability as Binary Constraint Satisfaction

Reference:

Matti Järvisalo and Ilkka Niemelä. A compact reformulation of propositional satisfiability as binary constraint satisfaction. In Proceedings of the Third International Workshop on Modelling and Reformulating Constraint Satisfaction Problems: Towards Systemisation and Automation, September 2004.

Suggested BibTeX entry:

@inproceedings{JN:Reform04,
    author = {Matti J{\"a}rvisalo and Ilkka Niemel{\"a}},
    booktitle = {Proceedings of the Third International Workshop on Modelling and Reformulating Constraint Satisfaction Problems: Towards Systemisation and Automation},
    month = {September},
    title = {A Compact Reformulation of Propositional Satisfiability as Binary Constraint Satisfaction},
    year = {2004},
}

See www.tcs.hut.fi ...

[TCS main] [Contact Info] [Personnel] [Research] [Publications] [Software] [Studies] [News Archive] [Links]
Latest update: 19 January 2010.