BibTeX record conf/stacs/DurandH03

download as .bib file

@inproceedings{DBLP:conf/stacs/DurandH03,
  author       = {Arnaud Durand and
                  Miki Hermann},
  editor       = {Helmut Alt and
                  Michel Habib},
  title        = {The Inference Problem for Propositional Circumscription of Affine
                  Formulas Is coNP-Complete},
  booktitle    = {{STACS} 2003, 20th Annual Symposium on Theoretical Aspects of Computer
                  Science, Berlin, Germany, February 27 - March 1, 2003, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {2607},
  pages        = {451--462},
  publisher    = {Springer},
  year         = {2003},
  url          = {https://doi.org/10.1007/3-540-36494-3\_40},
  doi          = {10.1007/3-540-36494-3\_40},
  timestamp    = {Thu, 14 Oct 2021 10:38:16 +0200},
  biburl       = {https://dblp.org/rec/conf/stacs/DurandH03.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
a service of  Schloss Dagstuhl - Leibniz Center for Informatics