Detecting Cardinality Constraints in CNF

Aus International Center for Computational Logic
Wechseln zu:Navigation, Suche

Toggle side column

Detecting Cardinality Constraints in CNF

Armin BiereArmin Biere,  Daniel Le BerreDaniel Le Berre,  Emmanuel LoncaEmmanuel Lonca,  Norbert MantheyNorbert Manthey
Armin Biere, Daniel Le Berre, Emmanuel Lonca, Norbert Manthey
Detecting Cardinality Constraints in CNF
In Carsten Sinz and Uwe Egly, eds., Theory and Applications of Satisfiability Testing ? SAT 2014, volume 8561 of Lecture Notes in Computer Science, 285-301, 2014. Springer
The final publication is available at Springer via http://dx.doi.org/10.1007/978-3-319-09284-3_22.
@inproceedings{BBLM2014,
  author    = {Armin Biere and Daniel Le Berre and Emmanuel Lonca and Norbert
               Manthey},
  title     = {Detecting Cardinality Constraints in {CNF}},
  editor    = {Carsten Sinz and Uwe Egly},
  booktitle = {Theory and Applications of Satisfiability Testing ? {SAT} 2014},
  series    = {Lecture Notes in Computer Science},
  volume    = {8561},
  publisher = {Springer},
  year      = {2014},
  pages     = {285-301},
  doi       = {10.1007/978-3-319-09284-3_22}
}