BibTeX record conf/sat/BeyersdorffMTV09

download as .bib file

@inproceedings{DBLP:conf/sat/BeyersdorffMTV09,
  author       = {Olaf Beyersdorff and
                  Arne Meier and
                  Michael Thomas and
                  Heribert Vollmer},
  editor       = {Oliver Kullmann},
  title        = {The Complexity of Reasoning for Fragments of Default Logic},
  booktitle    = {Theory and Applications of Satisfiability Testing - {SAT} 2009, 12th
                  International Conference, {SAT} 2009, Swansea, UK, June 30 - July
                  3, 2009. Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {5584},
  pages        = {51--64},
  publisher    = {Springer},
  year         = {2009},
  url          = {https://doi.org/10.1007/978-3-642-02777-2\_7},
  doi          = {10.1007/978-3-642-02777-2\_7},
  timestamp    = {Mon, 16 Sep 2019 15:30:17 +0200},
  biburl       = {https://dblp.org/rec/conf/sat/BeyersdorffMTV09.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
a service of  Schloss Dagstuhl - Leibniz Center for Informatics